Rate-monotonic scheduling for hard-real-time systems
From MaRDI portal
Publication:1278515
DOI10.1016/S0377-2217(97)83306-1zbMath0917.90181MaRDI QIDQ1278515
Alan A. Bertossi, Andrea Fusiello
Publication date: 5 August 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
packingdeterministic schedulingmultiprocessor systemsperiodic tasksfault-tolerant systemssingle processorhard-real-time systemsrate-monotonic algorithmtime deadlines
Related Items (2)
Reliability of fault-tolerant systems with parallel task processing ⋮ Rate-monotonic scheduling for hard-real-time systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
- A note on preemptive scheduling of periodic, real-time tasks
- Rate-monotonic scheduling for hard-real-time systems
- On Scheduling Tasks with a Quick Recovery from Failure
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Performance Guarantees for Scheduling Algorithms
- On a Real-Time Scheduling Problem
- New strategies for assigning real-time tasks to multiprocessor systems
- Priority inheritance protocols: an approach to real-time synchronization
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Rate-monotonic scheduling for hard-real-time systems
