Fault-tolerant scheduling in homogeneous real-time systems
From MaRDI portal
Publication:5176179
DOI10.1145/2534028zbMath1305.68044OpenAlexW2078971322MaRDI QIDQ5176179
Publication date: 2 March 2015
Published in: ACM Computing Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2534028
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- On Scheduling Tasks with a Quick Recovery from Failure
- A fault-tolerant scheduling problem
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
- Performance measures for control computers
- Clock Synchronization in Distributed Real-Time Systems
- Bounds on Multiprocessing Timing Anomalies
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fault-tolerant scheduling in homogeneous real-time systems