Abstract
Scheduling policies are of crucial importance to real-time systems.Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects.
Cite
CITATION STYLE
Burns, A., Wellings, A. J., & Taft, S. T. (2004). Supporting deadlines and edf scheduling in ada. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3063, pp. 156–165). Springer Verlag. https://doi.org/10.1007/978-3-540-24841-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
