Extending Task-Level to Job-Level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-Deadlines

Provided by: University of Peloponnese
Topic: Hardware
Format: PDF
In global real-time multiprocessor scheduling, a recent analysis technique for Task-level Fixed-Priority (TFP) scheduling has been shown to outperform many of the analyses for Job-level Fixed-Priority (JFP) scheduling on average. Since JFP is a generalization of TFP scheduling, and the TFP analysis technique itself has been adapted from an earlier JFP analysis, this result is counter-intuitive and in the authors' opinion highlights the lack of good JFP scheduling techniques. Towards generalizing the superior TFP analysis to JFP scheduling, they propose the Smallest Pseudo-Deadline First (SPDF) JFP scheduling algorithm.

Find By Topic