Abstract
Hierarchical scheduling is a basic technique to achieve temporal isolation between applications in high-integrity systems when an integrated approach is opted for over traditional federation. While comparatively heavyweight approaches to hierarchical scheduling have been prevailing until now, the new scheduling features of Ada 2005 enable lighter-weight techniques to be used. This will expectedly result in increasing the efficiency and flexibility of hierarchical scheduling, thus enabling new ways to developing critical applications in Ada. The paper explores the new opportunities opened by Ada 2005 and proposes some concrete techniques for implementing hierarchical scheduling in the new version of the language.
This work has been supported by the Spanish Ministry of Education, project no. TIC2002-04123-C03-01.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ISO/IEC: TR 15942:2000 — Guide for the use of the Ada programming language in high integrity systems (2000)
Vardanega, T.: Development of on-board embedded real-time systems: An engineering approach. Technical Report ESA STR-260, European Space Agency (1999) ISBN 90-9092-334-2
ARINC: Avionics Application Software Standard Interface — ARINC Specification 653-1 (2003)
Tokar, J.L.: Space & time partitioning with ARINC 653 and pragma profile. Ada Letters XXIII, 52–54 (2003); Proceedings of the 12th International Real-Time Ada Workshop (IRTAW 12)
Dobbing, B.: Building partitioned architectures based on the Ravenscar profile. Ada Lett. XX, 29–31 (2000)
Davis, R., Burns, A.: Hierarchical fixed priority pre-emptive scheduling. Technical Report YCS-2005-385, University of York (2005)
Sha, L., Lehoczky, J., Rajkumar, R.: Solutions for some practical problems in prioritized preemptive scheduling. In: IEEE Real-Time Systems Symposium. IEEE Computer Society Press, Los Alamitos (1986)
Strosnider, J., Lehoczky, J., Sha, L.: The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Tr. on Computers 44 (1995)
Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard real-time systems. Real-Time Systems 1 (1989)
ISO SC22/WG9: Ada Reference Manual. Language and Standard Libraries. Consolidated Standard ISO/IEC 8652:1995(E) with Technical Corrigendum 1 and Amendment 1 (Draft 15) (2005), Available on http://www.adaic.com/standards/rm-amend/html/RM-TTL.html
Baker, T.P.: Stack-based scheduling for realtime processes. Real-Time Systems 3, 67–99 (1991)
Burns, A., Dobbing, B., Vardanega, T.: Guide for the use of the Ada Ravenscar profile in high integrity systems. Technical Report YCS-2003-348, University of York (2003)
Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20 (1973)
Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation 2 (1982)
Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8 (1993)
Klein, M.H., Ralya, T., Pollack, B., Obenza, R., González-Harbour, M.: A Practitioner’s Handbook for Real-Time Analysis. In: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston (1993)
Audsley, N., Burns, A., Richardson, M., Wellings, A.: Hard real-time scheduling: The deadline-monotonic approach. In: Halang, W.A., Ramamrithan, K. (eds.) Real Time Programming 1991. Proceedings of the IFAC/IFIP Workshop. Pergamon Press, Oxford (1992)
Sha, L., Abdelzaher, T., Årzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., Mok, A.: Real time scheduling theory: A historical perspective. Real-Time Systems 28, 101–155 (2004)
Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst. 2, 301–324 (1990)
Spuri, M., Buttazzo, G.C.: Efficient aperiodic service under earliest deadline scheduling. In: IEEE Real-Time Systems Symposium (1994)
Spuri, M.: Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA, France (1996)
Shin, I., Lee, I.: Periodic resource model for compositional real-time guarantees. In: Proceedings of the 24th IEEE Real-Time Systems Symposium (2003)
González-Harbour, M., Palencia, J.C.: Response time analysis for tasks scheduled under EDF within fixed priorities. In: Proceedings of the 24th IEEE Real-Time Systems Symposium, Cancún, México (2003)
Amey, P., Chapman, R., White, N.: Smart certification of mixed criticality systems. In: Vardanega, T., Wellings, A.J. (eds.) Ada-Europe 2005, vol. 3555, pp. 144–155. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pulido, J.A., Urueña, S., Zamorano, J., Vardanega, T., de la Puente, J.A. (2006). Hierarchical Scheduling with Ada 2005. In: Pinho, L.M., González Harbour, M. (eds) Reliable Software Technologies – Ada-Europe 2006. Ada-Europe 2006. Lecture Notes in Computer Science, vol 4006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767077_1
Download citation
DOI: https://doi.org/10.1007/11767077_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34663-0
Online ISBN: 978-3-540-34664-7
eBook Packages: Computer ScienceComputer Science (R0)