On the public citation graph

Scheduling Analysis under Fault Bursts

https://doi.org/10.1109/rtas.2011.19
0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01088593openalex-snapshot
An extendible approach for analyzing fixed priority hard real-time tasks
inferredcites →https://doi.org/10.1016/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/s1383-7621(99)00016-8openalex-snapshot
Worst-case deadline failure probability in real-time applications distributed over controller area network
inferredcites →https://doi.org/10.1016/s1474-6670(17)51283-5openalex-snapshot
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
inferredcites →https://doi.org/10.1049/sej.1993.0034openalex-snapshot
Applying new scheduling theory to static priority pre-emptive scheduling
inferredcites →https://doi.org/10.1093/comjnl/29.5.390openalex-snapshot
Finding Response Times in a Real-Time System
inferredcites →https://doi.org/10.1109/12.729793openalex-snapshot
Minimum achievable utilization for fault-tolerant processing of periodic tasks
inferredcites →https://doi.org/10.1109/emrts.2001.934034openalex-snapshot
An effective schedulability analysis for fault-tolerant hard real-time systems
inferredcites →https://doi.org/10.1109/emwrts.1996.557785openalex-snapshot
Feasibility analysis of fault-tolerant real-time task sets
inferredcites →https://doi.org/10.1109/real.1989.63567openalex-snapshot
The rate monotonic scheduling algorithm: exact characterization and average case behavior
inferredcites →https://doi.org/10.1109/tc.2003.1234530openalex-snapshot
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
inferredcites →https://doi.org/10.1109/tc.2007.70739openalex-snapshot
Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks
inferredcites →https://doi.org/10.1109/tse.1986.6312999openalex-snapshot
A fault-tolerant scheduling problem
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/390016.808467openalex-snapshot
System structure for software fault tolerance
inferredcites →https://doi.org/10.4271/arp5583aopenalex-snapshot
Guide to Certification of Aircraft in a High-Intensity Radiated Field (HIRF) Environment

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-32548-9_28openalex-snapshot
Schedulability Guarantees for Dependable Distributed Real-Time Systems under Error Bursts
inferred← citeshttps://doi.org/10.1007/s11241-014-9202-zopenalex-snapshot
Fault-tolerant and real-time scheduling for mixed-criticality systems
inferred← citeshttps://doi.org/10.1007/s11241-014-9210-zopenalex-snapshot
Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-016-9258-zopenalex-snapshot
Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
inferred← citeshttps://doi.org/10.1016/j.procs.2015.01.027openalex-snapshot
Fault Tolerant Scheduling of Mixed Criticality Real-time Tasks under Error Bursts
inferred← citeshttps://doi.org/10.1109/codesisss.2015.7331368openalex-snapshot
Analysis and optimization of soft error tolerance strategies for real-time systems
inferred← citeshttps://doi.org/10.1109/cscs.2013.49openalex-snapshot
Probabilistic Schedulability Analysis for Fault Tolerant Tasks under Stochastic Error Occurrences
inferred← citeshttps://doi.org/10.1109/ecrts.2013.35openalex-snapshot
Towards Efficient Probabilistic Scheduling Guarantees for Real-Time Systems Subject to Random Errors and Random Bursts of Errors
inferred← citeshttps://doi.org/10.1109/etfa.2012.6489644openalex-snapshot
Probabilistic scheduling guarantees in distributed real-time systems under error bursts
inferred← citeshttps://doi.org/10.1109/etfa.2014.7005170openalex-snapshot
Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts
inferred← citeshttps://doi.org/10.1109/icicict1.2017.8342788openalex-snapshot
Guaranteeing fault tolerance in real time systems under error bursts
inferred← citeshttps://doi.org/10.1109/itaic.2014.7064998openalex-snapshot
Schedulability analysis for Fault tolerance real-time system under fault bursts
inferred← citeshttps://doi.org/10.1109/prdc.2018.00010openalex-snapshot
Do Nothing, But Carefully: Fault Tolerance with Timing Guarantees for Multiprocessor Systems Devoid of Online Adaptation
inferred← citeshttps://doi.org/10.1109/rtas.2014.6925991openalex-snapshot
Real-time scheduling under fault bursts with multiple recovery strategy
inferred← citeshttps://doi.org/10.1109/rtas.2015.7108448openalex-snapshot
C'Mon: a predictable monitoring infrastructure for system-level latent fault detection and recovery
inferred← citeshttps://doi.org/10.1109/rtas54340.2022.00011openalex-snapshot
A Mixed-Criticality Approach to Fault Tolerance: Integrating Schedulability and Failure Requirements
inferred← citeshttps://doi.org/10.1109/rtss.2013.11openalex-snapshot
Predictable, Efficient System-Level Fault Tolerance in C^3
inferred← citeshttps://doi.org/10.1109/rtss.2016.037openalex-snapshot
Systems with Dynamic Real-Time Guarantees in Uncertain and Faulty Execution Environments
inferred← citeshttps://doi.org/10.1109/tii.2016.2543232openalex-snapshot
Error Handling Algorithm and Probabilistic Analysis Under Fault for CAN-Based Steer-by-Wire System
inferred← citeshttps://doi.org/10.1109/trustcom.2011.157openalex-snapshot
Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts
inferred← citeshttps://doi.org/10.1145/2392987.2392992openalex-snapshot
Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts
inferred← citeshttps://doi.org/10.1145/2782753.2782754openalex-snapshot
Supporting fault-tolerance in a compositional real-time scheduling framework
inferred← citeshttps://doi.org/10.1145/3589950openalex-snapshot
Software Fault Tolerance in Real-Time Systems: Identifying the Future Research Questions
inferred← citeshttps://doi.org/10.1155/2016/5196092openalex-snapshot
Bounds on Worst-Case Deadline Failure Probabilities in Controller Area Networks
inferred← citeshttps://doi.org/10.25148/etd.fidc000077openalex-snapshot
Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems
inferred← citeshttps://doi.org/10.70675/70e430f0z5578z44bbzbda6z7a0165748e0fopenalex-snapshot
Combinaison des aspects temps réel et sûreté de fonctionnement pour la conception des plateformes avioniques
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.