On the public citation graph
Optimal scheduling for fault-tolerant and firm real-time systems
0 signed · 46 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00360340openalex-snapshot
Scheduling aperiodic tasks in dynamic priority systems
inferredcites →https://doi.org/10.1007/bf00365393openalex-snapshot
Stack-based scheduling of realtime processes
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.1049/sej.1991.0013openalex-snapshot
An adaptive scheduling algorithm for fault-tolerant real-time systems
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.1109/emwrts.1996.557785openalex-snapshot
Feasibility analysis of fault-tolerant real-time task sets
inferredcites →https://doi.org/10.1109/iceccs.1997.622295openalex-snapshot
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
inferredcites →https://doi.org/10.1109/real.1994.342735openalex-snapshot
Efficient aperiodic service under earliest deadline scheduling
inferredcites →https://doi.org/10.1109/real.1995.495201openalex-snapshot
Skip-Over: algorithms and complexity for overloaded systems that allow skips
inferredcites →https://doi.org/10.1109/real.1997.641294openalex-snapshot
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
inferredcites →https://doi.org/10.1109/rtcsa.1997.629219openalex-snapshot
Analysis of checkpointing for schedulability of real-time systems
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11572329_14openalex-snapshot
Scheduling Fixed-Priority Hard Real-Time Tasks in the Presence of Faults
inferred← citeshttps://doi.org/10.1007/3-540-45307-5_7openalex-snapshot
An Adaptive Scheme for Fault-Tolerant Scheduling of Soft Real-Time Tasks in Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_94openalex-snapshot
Supporting Fault-Tolerant Real-Time Applications using the RED-Linux General Scheduling Framework
inferred← citeshttps://doi.org/10.1007/s11241-006-4962-8openalex-snapshot
Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.015openalex-snapshot
Efficient overloading techniques for primary-backup scheduling in real-time systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.09.021openalex-snapshot
An adaptive scheme for fault-tolerant scheduling of soft real-time tasks in multiprocessor systems
inferred← citeshttps://doi.org/10.1016/j.parco.2006.06.006openalex-snapshot
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems
inferred← citeshttps://doi.org/10.1109/cse.2009.14openalex-snapshot
An Effective RM-Based Scheduling Algorithm for Fault-Tolerant Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ds-rt.2006.33openalex-snapshot
Scheduling Hard-Real-Time Tasks with Backup Phasing Delay
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209927openalex-snapshot
An algorithm for automatically obtaining distributed and fault-tolerant static schedules
inferred← citeshttps://doi.org/10.1109/iccece46942.2019.8941669openalex-snapshot
FPGA-based Task Scheduler for Mixed-Criticality Real-Time Systems
inferred← citeshttps://doi.org/10.1109/icecs.2011.6122386openalex-snapshot
Partitioned EDF scheduling in multicore systems with quality of service constraints
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925102openalex-snapshot
Generation of fault-tolerant static scheduling for real-time distributed embedded systems with multi-point links
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370342openalex-snapshot
A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1109/isie.2011.5984212openalex-snapshot
Bandwidth-efficient admission control for EDF-based wireless industrial communication
inferred← citeshttps://doi.org/10.1109/meco49872.2020.9134328openalex-snapshot
RED-based Scheduler on Chip for Mixed-Criticality Real-Time Systems
inferred← citeshttps://doi.org/10.1109/meco55406.2022.9797213openalex-snapshot
Scheduling Periodic Real-Time Tasks with Inter-Task Synchronisation
inferred← citeshttps://doi.org/10.1109/real.2002.1181585openalex-snapshot
Scheduling tasks with mixed preemption relations for robustness to timing faults
inferred← citeshttps://doi.org/10.1109/real.2004.36openalex-snapshot
On Fault-Sensitive Feasibility Analysis of Real-Time Task Sets
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.12openalex-snapshot
Providing Memory QoS Guarantees for Real-Time Applications
inferred← citeshttps://doi.org/10.1109/tc.2003.1234530openalex-snapshot
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
inferred← citeshttps://doi.org/10.1109/tc.2007.70739openalex-snapshot
Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/tsmca.2009.2013192openalex-snapshot
Exploiting Redundancies to Enhance Schedulability in Fault-Tolerant and Real-Time Distributed Systems
inferred← citeshttps://doi.org/10.1145/1654059.1654092openalex-snapshot
Supporting fault-tolerance for time-critical events in distributed environments
inferred← citeshttps://doi.org/10.1145/2442087.2442094openalex-snapshot
Shared recovery for energy efficiency and reliability enhancements in real-time applications with precedence constraints
inferred← citeshttps://doi.org/10.1145/2534028openalex-snapshot
Fault-tolerant scheduling in homogeneous real-time systems
inferred← citeshttps://doi.org/10.1145/3811257.3811264openalex-snapshot
SYrtos: Extending SYCL for Real-Time Programming
inferred← citeshttps://doi.org/10.1155/2010/298578openalex-snapshot
Supporting Fault-Tolerance for Time-Critical Events in Distributed Environments
inferred← citeshttps://doi.org/10.31274/rtd-180813-11503openalex-snapshot
Controlling schedulability-reliability trade-offs in real-time systems
inferred← citeshttps://doi.org/10.3390/electronics12081870openalex-snapshot
A New FPGA-Based Task Scheduler for Real-Time Systems
inferred← citeshttps://doi.org/10.5753/wtf.2007.23237openalex-snapshot
Suporte à Degradação Controlada em Sistemas de Tempo Real
inferred← citeshttps://doi.org/10.5772/2344openalex-snapshot
Real-Time Systems, Architecture, Scheduling, and Application
inferred← citeshttps://doi.org/10.5772/37318openalex-snapshot
Quality of Service Scheduling in the Firm Real-Time Systems
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.