The static-priority scheduling of periodic task systems upon identical multiprocessor platforms

摘要

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: (ⅰ) we present an improved test for determining whether a task system is successfully scheduled by the (multiprocessor extension of the) rate-monotonic scheduling algorithm, (ⅱ) 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 priority-assignment algorithm successfully finds good priority assignments for some periodic task systems that are not RM-feasible.