Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems

Authors:
Liliana Cucu-Grosjean;Joël Goossens
Affiliations:
U.L.B., Computer Science, Bld. du Triomphe, CP 212, Bruxelles, Belgium;U.L.B., Computer Science, Bld. du Triomphe, CP 212, Bruxelles, Belgium
Venue:
Information Processing Letters
Year:
2010

Citing 2
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Predictability of least laxity first scheduling algorithm on multiprocessor real-time systems

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.94

Visualization

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.