Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems
DOI10.1016/J.IPL.2010.03.009zbMATH Open1229.68012arXiv0908.3519OpenAlexW2075217266MaRDI QIDQ656587FDOQ656587
Joël Goossens, Liliana Cucu-Grosjean
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.3519
Recommendations
- An analysis of fixed-priority schedulability on a multiprocessor
- Multiprocessor scheduling for real-time systems
- Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
- FPSL, FPCL and FPZL schedulability analysis
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (2)
This page was built for publication: Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656587)