Schedulability test of EPDF Pfair algorithm on multiprocessor platforms
Yan Li · Computer Engineering and Applications Journal · 2013
For the Earliest-Pseudo-Deadline-Firs(tEPDF)Pfair algorithm on multiprocessor platforms, according to the schedulable utilization bound of EPDF on M processors and utilization-based schedulability test, an improved schedulability test for EPDF has been proposed. This method can detect more tasks scheduled, which will enable less-expensive scheduling for hard real-time systems that satisfy the test and dynamic task systems where tie-breaking rules are problematic. The experimental results demonstrate that the presented schedulability test with better performance increases the amount of detected task sets.