Abstract
Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.
- T. P. Baker. Stack-based scheduling of realtime processes. Real Time Systems, 3(1), 1991. Google Scholar
Digital Library
- A Burns and A. J.Wellings. Concurrent and Real-Time Programming in Ada. Cambridge University Press, 2007. Google Scholar
Digital Library
- J.W.S. Liu. Real-Time Systems. Prentice Hall, 2000.Google Scholar
Recommendations
Global EDF-based scheduling with laxity-driven priority promotion
This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Global EDF-Based Scheduling with Efficient Priority Promotion
RTCSA '08: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsThis paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that ...
Scheduling Multiprocessor Tasks to Minimize Schedule Length
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for ...






Comments