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.









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)