Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT

  • Mario Aldea Rivas
  • Michael González Harbour
  • José F. Ruiz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5570)


The Ada 2005 task dispatching model includes new scheduling policies such as EDF and round robin, in addition to the traditional fixed priority dispatching, and allows mixing these policies into a hierarchy of schedulers. This hierarchical scheduling model is a very interesting solution that allows us to have in the same system the best properties of the three policies: the high performance of EDF, the predictability of fixed priorities, and the fair distribution of unused capacity provided by a round robin scheduler. The paper presents one of the first implementations of this hierarchical dispatching model, built with GNAT over MaRTE OS. An evaluation of the implementation is provided and examples of usage are shown.


Ada 2005 Real-Time Systems Scheduling Compilers POSIX 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Kirner, R., Puschner, P., Wenzel, I.: Measurement-Based Worst-Case Execution Time Analysis using Automatic Test-Data Generation. In: Proc. 4th Euromicro International Workshop on Worst Case Execution Time, Catania, Sicily, Italy, June 29 (2004)Google Scholar
  3. 3.
    Bernat, G., Colin, A., Petters, S.M.: WCET Analysis of Probabilistic Hard Real-Time systems. In: Real-Time Systems Symposium, Austin, Texas, USA (December 2002)Google Scholar
  4. 4.
    Bernat, G., Newby, M.J., Burns, A.: Probabilistic timing analysis: an approach using copulas. Journal of Embedded Computing 1-2, 179–194 (2005)Google Scholar
  5. 5.
    Vestal, S.: Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: Proceedings of the Real-Time Systems Symposium, Tucson, AZ, pp. 239–243 (December 2007)Google Scholar
  6. 6.
    Baker, T.P.: Stack-Based Scheduling of Realtime Processes. Journal of Real-Time Systems 3(1), 67–99 (1991)CrossRefGoogle Scholar
  7. 7.
    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, Cancun, Mexico (December 2003)Google Scholar
  8. 8.
    Baruah, S., Vestal, S.: Schedulability analysis of sporadic tasks with multiple criticality specifications. In: Proceedings of the 20th Euromicro Conference on Real-Time Systems (ECRTS 2008), Prague, July 2-4 (2008)Google Scholar
  9. 9.
    Aldea, M., González, M.: MaRTE OS: An Ada Kernel for Real-Time Embedded Applications. In: Strohmeier, A., Craeynest, D. (eds.) Ada-Europe 2001. LNCS, vol. 2043, p. 305. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    MaRTE OS home page,
  11. 11.
    Aldea, M., Miranda, J., Harbour, M.G.: Integrating Application-Defined Scheduling with the New Dispatching Policies for Ada Tasks. In: Vardanega, T., Wellings, A.J. (eds.) Ada-Europe 2005. LNCS, vol. 3555, pp. 220–235. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Zerzelidis, A., Burns, A., Wellings, A.J.: Correcting the EDF protocol in Ada 2005. In: ACM Ada Letters, IRTAW 2007: Proceedings of the 13th international workshop on Real-time Ada (April 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mario Aldea Rivas
    • 1
  • Michael González Harbour
    • 1
  • José F. Ruiz
    • 2
  1. 1.Grupo de Computadores y Tiempo RealUniversidad de CantabriaSantanderSpain
  2. 2.AdaCoreParisFrance

Personalised recommendations