New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms

Download Now
Provided by: Uppror Media Group
Topic: Hardware
Format: PDF
The authors study the schedulability analysis problem for non-preemptive scheduling algorithms on multiprocessors. To their best knowledge, the only known work on this problem is the test condition proposed by the researcher 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, they derive a linear-time test condition which avoids the problem mentioned above, by building upon the work in for preemptive multiprocessor scheduling.
Download Now

Find By Topic