The Static-priority Scheduling of Periodic Task Systems upon Identical Multiprocessor Platforms
Sanjoy Baruah, Joël Goossens · 2003
We study the global, static-priority scheduling of periodic task systems upon multiprocessor platforms comprised of identical processors. We improve upon earlier results in several ways: (i) we present an improved test for determining whether a task system is successfully scheduled by the (multiprocessor extension of the) rate-monotonic scheduling algorithm. (ii) For periodic task systems that cannot be scheduled using rate-monotonic priorities, we propose a new polynomial-time algorithm for assigning priorities in a manner that is not rate-monotonic; this new priorityassignment algorithm successfully finds good priority assignments feasible.