Advertisement

Hierarchical Scheduling with Ada 2005

  • José A. Pulido
  • Santiago Urueña
  • Juan Zamorano
  • Tullio Vardanega
  • Juan A. de la Puente
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4006)

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.

Keywords

Sporadic Task Response Time Analysis Temporal Isolation Local Scheduler Global Scheduler 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    ISO/IEC: TR 15942:2000 — Guide for the use of the Ada programming language in high integrity systems (2000) Google Scholar
  2. 2.
    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-2Google Scholar
  3. 3.
    ARINC: Avionics Application Software Standard Interface — ARINC Specification 653-1 (2003)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Dobbing, B.: Building partitioned architectures based on the Ravenscar profile. Ada Lett. XX, 29–31 (2000)CrossRefGoogle Scholar
  6. 6.
    Davis, R., Burns, A.: Hierarchical fixed priority pre-emptive scheduling. Technical Report YCS-2005-385, University of York (2005)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Sprunt, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard real-time systems. Real-Time Systems 1 (1989)Google Scholar
  10. 10.
    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
  11. 11.
    Baker, T.P.: Stack-based scheduling for realtime processes. Real-Time Systems 3, 67–99 (1991)CrossRefGoogle Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20 (1973)Google Scholar
  14. 14.
    Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation 2 (1982)Google Scholar
  15. 15.
    Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8 (1993)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)CrossRefzbMATHGoogle Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
    Spuri, M., Buttazzo, G.C.: Efficient aperiodic service under earliest deadline scheduling. In: IEEE Real-Time Systems Symposium (1994)Google Scholar
  21. 21.
    Spuri, M.: Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA, France (1996)Google Scholar
  22. 22.
    Shin, I., Lee, I.: Periodic resource model for compositional real-time guarantees. In: Proceedings of the 24th IEEE Real-Time Systems Symposium (2003)Google Scholar
  23. 23.
    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)Google Scholar
  24. 24.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • José A. Pulido
    • 1
  • Santiago Urueña
    • 1
  • Juan Zamorano
    • 1
  • Tullio Vardanega
    • 2
  • Juan A. de la Puente
    • 1
  1. 1.Departamento de Ingeniería de Sistemas Telemáticos (DIT)Universidad Politécnica de Madrid (UPM)MadridSpain
  2. 2.Dipartimento di Matematica Pura ed ApplicataUniversità di PadovaPadovaItaly

Personalised recommendations