When analysing hard real-time systems for their performance properties, most scheduling models either ignore the timing characteristics of the underlying run-time support kernel entirely or have a very simple model of its behaviour. However, when engineering an actual implementation, it is necessary to tailor the scheduling theory so that the actual performance characteristics of the run-time system are adequately addressed. Failure to do this may result in a “guaranteed” task missing its deadline. In this paper we investigate an actual Ada run-time kernel and give performance measures for clock handling and delay queue manipulation. The impact these measures have on the scheduling models are discussed.
CITATION STYLE
Burns, A., Wellings, A. J., & Hutcheon, A. D. (1993). The impact of an Ada run-time system’s performance characteristics on scheduling models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 688 LNCS, pp. 240–248). Springer Verlag. https://doi.org/10.1007/3-540-56802-6_19
Mendeley helps you to discover research relevant for your work.