A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
TL-plane-based multi-core energy-efficient real-time scheduling algorithm for sporadic tasks
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Partially non-preemptive dual priority multiprocessor scheduling
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On using adversary simulators to obtain tight lower bounds for response times
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Optimization of task allocation and priority assignment in hard real-time distributed systems
ACM Transactions on Embedded Computing Systems (TECS)
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
A global optimal scheduling algorithm for multiprocessor low-power platforms
Proceedings of the 20th International Conference on Real-Time and Network Systems
Journal of Systems and Software
Hi-index | 0.00 |
This paper addresses the problem of priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. In this paper, 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.