Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

TL;DR

This paper proves that Fixed-Job Priority schedulers are predictable on heterogeneous multiprocessor platforms, including unrelated and uniform systems, simplifying schedulability analysis for real-time systems.

Contribution

It establishes the predictability of FJP schedulers on heterogeneous platforms, a key property for real-time system analysis, which was previously unconfirmed.

Findings

FJP schedulers are predictable on unrelated platforms

Predictability extends to uniform multiprocessors

Simplifies schedulability analysis for heterogeneous systems

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.