Multiprocessor Real-Time Scheduling Considering Concurrency and Urgency

Provided by: University of Peloponnese
Topic: Hardware
Format: PDF
It has been widely studied how to schedule realtime tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors: inter-job concurrency and job urgency. In this paper, the authors introduce a new scheduling policy that considers these two properties. They prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair.

Find By Topic