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.
Download Not Available

BibTex Entry

@article{Wellings2010c,
 address = {New York, NY, USA},
 author = {A. J. Wellings and A. Burns},
 doi = {http://doi.acm.org/10.1145/1806546.1806559},
 issn = {1094-3641},
 journal = {Ada Lett.},
 number = {1},
 pages = {116--124},
 publisher = {ACM},
 title = {Generalizing the EDF scheduling support in Ada 2005},
 volume = {30},
 year = {2010}
}