Advertisement

Towards a Time-Composable Operating System

  • Andrea Baldovin
  • Enrico Mezzetti
  • Tullio Vardanega
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7896)

Abstract

Compositional approaches to the qualification of hard real-time systems rest on the premise that the individual units of development can be incrementally composed preserving the timing behaviour they had in isolation. In practice, however, the assumption of time composability is often wavering due to the inter-dependences stemming from inherent nature of hardware and software. The operating system, mediator between the applications and the underlying hardware, plays a critical role in enabling time composability. This paper discusses the challenges faced in the implementation of a truly time-composable operating system based on ORK+, a Ravenscar-compliant real-time kernel.

Keywords

Time composability Real-time operating system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Altmeyer, S., Maiza, C., Reineke, J.: Resilience analysis: Tightening the CRPD bound for set-associative caches. In: Proc. of the Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES 2010 (2010)Google Scholar
  2. 2.
    APEX Working Group: Draft 3 of Supplement 1 to ARINC Specification 653: Avionics Application Software Standard Interface (2003)Google Scholar
  3. 3.
    Baldovin, A., Graziano, A., Mezzetti, E., Vardanega, T.: Kernel-level time composability for avionics applications. In: Proceedings of the 28th ACM Symposium on Applied Computing, ACM SAC 2013, Coimbra, Portugal (2013)Google Scholar
  4. 4.
    Baldovin, A., Mezzetti, E., Vardanega, T.: A Time-composable Operating System. In: Proceedings of the 12th International Workshop on Worst-Case Execution Time Analysis (2012)Google Scholar
  5. 5.
    Blackham, B., Shi, Y., Chattopadhyay, S., Roychoudhury, A., Heiser, G.: Timing analysis of a protected operating system kernel. In: 2011 IEEE 32nd Real-Time Systems Symposium, RTSS, pp. 339–348 (2011)Google Scholar
  6. 6.
    Burns, A., Dobbing, B., Vardanega, T.: Guide for the Use of the Ada Ravenscar Profile in High Integrity Systems. TR YCS-2003-348, University of York (2003)Google Scholar
  7. 7.
    Buttazzo, G., Bertogna, M., Yao, G.: Limited preemptive scheduling for real-time systems: A survey. IEEE Transactions on Industrial Informatics 9(1), 3–15 (2013)CrossRefGoogle Scholar
  8. 8.
    De la Puente, J.A., Zamorano, J., Ruiz, J., Fernández, R., García, R.: The design and implementation of the open ravenscar kernel. Ada Lett. XXI(1), 85–90 (2001)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Hansson, A., Ekerhult, M., Molnos, A.M., Milutinovic, A., Nelson, A., Ambrose, J.A., Goossens, K.: Design and implementation of an operating system for composable processor sharing. Microprocessors and Microsystems - Embedded Hardware Design 35(2), 246–260 (2011)CrossRefGoogle Scholar
  11. 11.
    ISO SC22/WG9: Ada Reference Manual. Language and Standard Libraries. Consolidated Standard ISO/IEC 8652:1995(E) with Technical Corrigendum 1 and Amendment 1 (2005)Google Scholar
  12. 12.
    Kosmidis, L., Quinones, E., Abella, J., Vardanega, T., Cazorla, F.J.: Achieving timing composability with measurement-based probabilistic timing analysis. In: Proceedings of the 16th IEEE Symposium on Object/Component/Service-oriented Realtime Distributed Computing, ISORC, Pandeborn, Germany (2013)Google Scholar
  13. 13.
    Leiserson, C.E., Prokop, H., Randall, K.H.: Using de Bruijn Sequences to Index a 1 in a Computer Word (1998)Google Scholar
  14. 14.
    Liu, I., Reineke, J., Lee, E.A.: A PRET architecture supporting concurrent programs with composable timing properties. In: 44th Asilomar Conference on Signals, Systems, and Computers, pp. 2111–2115 (November 2010)Google Scholar
  15. 15.
    Molnar, I.: Goals, design and implementation of the new ultra-scalable O(1) scheduler. Linux Kernel, Source tree documentation (2002)Google Scholar
  16. 16.
    Mueller, F.: Compiler support for software-based cache partitioning. In: ACM Workshop on Languages, Compilers and Tools for Real-Time Systems (1995)Google Scholar
  17. 17.
    Puschner, P., Kirner, R., Pettit, R.G.: Towards composable timing for real-time software. In: Proc. 1st International Workshop on Software Technologies for Future Dependable Distributed Systems (March 2009)Google Scholar
  18. 18.
    Puschner, P., Schoeberl, M.: On composable system timing, task timing, and WCET analysis. In: Proceedings of the 8th International Workshop on Worst-Case Execution Time Analysis (2008)Google Scholar
  19. 19.
    Rapita Systems Ltd.: Rapitime, http://www.rapitasystems.com/rapitime
  20. 20.
    Reineke, J., Grund, D., Berg, C., Wilhelm, R.: Timing predictability of cache replacement policies. Real-Time Systems 37, 99–122 (2007)zbMATHCrossRefGoogle Scholar
  21. 21.
    Sangiovanni-Vincentelli, A.L., Di Natale, M.: Embedded system design for automotive applications. IEEE Computer 40(10), 42–51 (2007)CrossRefGoogle Scholar
  22. 22.
    Schneider, J.: Why you can’t analyze RTOSs without considering applications and vice versa. In: Proceedings of the 2nd International Workshop on Worst-Case Execution Time Analysis (2002)Google Scholar
  23. 23.
    Universidad Politécnica de Madrid: GNAT/ORK+ for LEON cross-compilation system, http://polaris.dit.upm.es/~ork
  24. 24.
    Vardanega, T., Zamorano, J., de la Puente, J.A.: On the dynamic semantics and the timing behavior of ravenscar kernels. Real-Time Systems 29(1), 59–89 (2005)zbMATHCrossRefGoogle Scholar
  25. 25.
    Varghese, G., Lauck, A.: Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility. IEEE/ACM Trans. Netw. 5(6), 824–834 (1997)CrossRefGoogle Scholar
  26. 26.
    Wilhelm, R., et al.: The worst-case execution time problem: overview of methods and survey of tools. Trans. on Embedded Computing Systems 7(3), 1–53 (2008)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Yao, G., Buttazzo, G.C., Bertogna, M.: Feasibility analysis under fixed priority scheduling with limited preemptions. Real-Time Systems 47(3), 198–223 (2011)zbMATHCrossRefGoogle Scholar
  28. 28.
    Zamorano, J., Ruiz, J.F., de la Puente, J.A.: Implementing Ada.Real_Time.Clock and Absolute Delays in Real-Time Kernels. In: Proceedings of the 6th International Conference on Reliable Software Technologies, pp. 317–327. Ada Europe (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Andrea Baldovin
    • 1
  • Enrico Mezzetti
    • 1
  • Tullio Vardanega
    • 1
  1. 1.Department of MathematicsUniversity of PaduaPaduaItaly

Personalised recommendations