Predictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systems
From MaRDI portal
Publication:656587
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.
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
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)