Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
From MaRDI portal
Publication:2481261
DOI10.1007/s11241-006-9009-7zbMath1141.68016OpenAlexW2046372823MaRDI QIDQ2481261
Sanjoy K. Baruah, Nathan Fisher
Publication date: 9 April 2008
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-006-9009-7
EDFSufficient conditionsSchedulability analysisFixed-priority schedulingFeasibility analysisMultiprocessor platformsRecurrent tasks
Cites Work
- Unnamed Item
- Unnamed Item
- An analysis of fixed-priority schedulability on a multiprocessor
- Dynamic- and static-priority scheduling of recurring real-time tasks
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems