| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 205.73 KB | Adobe PDF |
Advisor(s)
Abstract(s)
It has been widely studied how to schedule real-time 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,
we introduce a new scheduling policy that considers these two properties. We 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. It remains open to find a schedulability condition for
general task systems under our scheduling policy.