skip to main content
research-article

A comparison of compositional schedulability analysis techniques for hierarchical real-time systems

Published:05 September 2013Publication History
Skip Abstract Section

Abstract

Schedulability analysis of hierarchical real-time embedded systems involves defining interfaces that represent the underlying system faithfully and then compositionally analyzing those interfaces. Whereas commonly used abstractions, such as periodic and sporadic tasks and their interfaces, are simple and well studied, results for more complex and expressive abstractions and interfaces based on task graphs and automata are limited. One contributory factor may be the hardness of compositional schedulability analysis with task graphs and automata. Recently, conditional task models, such as the recurring branching task model, have been introduced with the goal of reaching a middle ground in the trade-off between expressivity and ease of analysis. Consequently, techniques for compositional analysis with conditional models have also been proposed, and each offer different advantages. In this work, we revisit those techniques, compare their advantages using an automotive case study, and identify limitations that would need to be addressed before adopting these techniques for use with real-world problems.

References

  1. Almeida, L. and Pedreiras, P. 2004. Scheduling within temporal partitions: Response-time analysis and server design. In Proceedings of the 4th ACM International Conference on Embedded Software (EMSOFT'04). ACM, New York, NY, 95--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anand, M. 2008. Conditional models for compostional analysis of real-time embedded systems. Ph.D. Dissertation, University of Pennsylvania, Philadelphia, PA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Anand, M., Easwaran, A., Fischmeister, S., and Lee, I. 2008. Compositional feasibility analysis for conditional task models. In Proceedings of the 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC). IEEE Computer Society, Washington, DC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Baruah, S. 1998a. Feasibility analysis of recurring branching tasks. In Proceedings of the 10th Euromicro Workshop on Real-Time Systems (ECRTS). 138--145.Google ScholarGoogle ScholarCross RefCross Ref
  5. Baruah, S. 1998b. A general model for recurring real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 114--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Baruah, S., Howell, R., and Rosier, L. 1990. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. J. Real-Time Sys. 2, 301--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bordoloi, U. D. and Chakraborty, S. 2006. Interactive schedulability analysis. In Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06). IEEE Computer Society, Washington, DC, 147--156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chakraborty, S., Kunzli, S., and Thiele, L. 2003. A general framework for analysing system properties in platform-based embedded system designs. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'03). IEEE Computer Society, Washington, DC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Company, F. M. 1988. ETX-I final report, vol 1. Tech. rep., Ford.Google ScholarGoogle Scholar
  10. Davis, R. I. and Burns, A. 2005. Hierarchical fixed priority pre-emptive scheduling. In Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS). IEEE Computer Society, Washington, DC, 389--398. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Easwaran, A., Anand, M., and Lee, I. 3-6 Dec. 2007. Compositional analysis framework using EDP resource models. In Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS). 129--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Feng, X. A. and Mok, A. K. 2002. A model of hierarchical real-time virtual resources. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Ghosal, A., Sangiovanni-Vincentelli, A., Kirsch, C. M., Henzinger, T. A., and Iercan, D. 2006. A Hierarchical coordination language for interacting real-time tasks. In Proceedings of the 6th ACM & IEEE International Conference on Embedded software. ACM Press, New York, NY, 132--141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Iercan, D. 2005. Master's thesis, Politehnica University of Timisoara.Google ScholarGoogle Scholar
  15. Kopetz, H. 1994. A solution to an automotive control system benchmark. Tech. rep. Research report 4/1994, Institut fur Technische Informatik, TU Wien.Google ScholarGoogle Scholar
  16. Lehoczky, J., Sha, L., and Ding, Y. 1989. The rate monotonic scheduling algorithm: exact characterization and average case behavior. In Proceedings of the IEEE Real-Time Systems Symposium. 166--171.Google ScholarGoogle Scholar
  17. Lipari, G. and Bini, E. 2003. Resource partitioning among real-time applications. In Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS). 151--158.Google ScholarGoogle Scholar
  18. Matic, S. and Henzinger, T. A. 2005. Trading end-to-end latency for composability. In Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS). IEEE Computer Society, Washington, DC, 99--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Meyerowitz, T., Pinello, C., and Sangiovanni-Vincentelli, A. 2003. A tool for describing and evaluating hierarchical real-time bus scheduling policies. In Proceedings of the 40th Conference on Design Automation (DAC). ACM, New York, NY, 312--317. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Natale, M. D. and Meschi, A. 2001. Scheduling messages with earliest deadline techniques. Real-Time Syst. J. 20, 3, 255--285. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. SAE. 1993. Class C application requirement considerations. Tech. rep. Technical Report J2056/1, Society of Automotive Engineers (SAE).Google ScholarGoogle Scholar
  22. SAE. 1994. SAE Handbook 1994 Ed. Society of Automotive Engineers (SAE).Google ScholarGoogle Scholar
  23. Saewong, S., Rajkumar, R., Lehoczky, J., and Klein, M. 2002. Analysis of hierarchical fixed-priority scheduling. In Proceedings of the Euromicro Conference on Real-Time Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Shin, I. and Lee, I. 2003. Periodic resource model for compositional real-time guarantees. In Proceedings of the IEEE Real-Time Systems Symposium. 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Shin, I. and Lee, I. 2004. Compositional real-time scheduling framework. In Proceedings of the IEEE Real-Time Systems Symposium. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Thiele, L., Chakraborty, S., and Naedele, M. 2000. Real-time calculus for scheduling hard real-time systems. In Proceedings of the International Symposium on Circuits and Systems (ISCAS). 101--104.Google ScholarGoogle Scholar
  27. Thiele, L., Wandeler, E., and Stoimenov, N. 2006. Real-time interfaces for composing real-time systems. In Proceedings of the 6th ACM International Conference on Embedded Software. 34--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Tindell, K. and Burns, A. 1997. Guaranteed message latencies for distributed safety critical hard real-time networks. Tech. rep. YCS 94-229, Department of Computer Science, University of York, York, U.K.Google ScholarGoogle Scholar

Index Terms

  1. A comparison of compositional schedulability analysis techniques for hierarchical real-time systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!