We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocessors. To our best knowledge, the only known work on this problem is the test condition proposed by Baruah [1] (referred to as [BAR-EDF np ]) for non-preemptive EDF scheduling, which will reject a task set with arbitrarily low utilization if it contains a task whose execution time is equal or greater than the minimal relative deadline among all tasks. In this paper, we firstly derive a linear-time test condition which avoids the problem mentioned above, by building upon the work in [2] for preemptive multiprocessor scheduling. This test condition works on not only non-preemptive EDF, but also any other work-conserving non-preemptive scheduling algorithms. Then we improve the analysis and present test conditions of pseudo-polynomial timecomplexity for Non-preemptive Earliest Deadline First scheduling (EDF np ) and Non-preemptive Fixed Priority scheduling (FP np ) respectively. Experiments with randomly generated task sets show that our proposed test conditions, especially the improved test conditions, have significant performance improvements compared with [BAR-EDF np ].
Guan et al. presented test conditions for non-preemptive EDF and fixed priority scheduling REF .
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
2008 Real-Time Systems Symposium
2008 Real-Time Systems Symposium
Computer Science