Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances made in schedulability analysis, and contains a number of significant additional results.
The paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling.
We prove that Audsley’s Optimal Priority Assignment (OPA) algorithm, originally devised for uniprocessor scheduling, is applicable to the multiprocessor case, provided that three conditions hold with respect to the schedulability tests used. Our empirical investigations show that the combination of optimal priority assignment policy and a simple compatible schedulability test is highly effective in terms of the number of tasksets deemed to be schedulable.
We also examine the performance of heuristic priority assignment policies such as Deadline Monotonic, and an extension of the TkC priority assignment policy called DkC that can be used with any schedulability test. Here we find that Deadline Monotonic priority assignment has relatively poor performance in the multiprocessor case, while DkC priority assignment is highly effective.
- Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
Volume 47, Issue 1 , pp 1-40
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- Optimal priority assignment
- Heuristic priority assignment
- Global scheduling
- Fixed priority
- Taskset generation
- Schedulability analysis
- Industry Sectors