Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems

From MaRDI portal
Publication:656587

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)

Abstract: The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.


Full work available at URL: https://arxiv.org/abs/0908.3519




Recommendations




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)