skip to main content
research-article

Compositional real-time scheduling framework with periodic model

Authors Info & Claims
Published:08 May 2008Publication History
Skip Abstract Section

Abstract

It is desirable to develop large complex systems using components based on systematic abstraction and composition. Our goal is to develop a compositional real-time scheduling framework to support abstraction and composition techniques for real-time aspects of components. In this paper, we present a formal description of compositional real-time scheduling problems, which are the component abstraction and composition problems. We identify issues that need be addressed by solutions and provide our framework for the solutions, which is based on the periodic interface. Specifically, we introduce the periodic resource model to characterize resource allocations provided to a single component. We present exact schedulability conditions for the standard Liu and Layland periodic task model and the proposed periodic resource model under EDF and RM scheduling, and we show that the component abstraction and composition problems can be addressed with periodic interfaces through the exact schedulability conditions. We also provide the utilization bounds of a periodic task set over the periodic resource model and the abstraction bounds of periodic interfaces for a periodic task set under EDF and RM scheduling. We finally present the analytical bounds of overheads that our solution incurs in terms of resource utilization increase and evaluate the overheads through simulations.

References

  1. Abeni, L. and Buttazzo, G. 1998. Integrating multimedia applications in hard real-time systems. In RTSS '98: Proceedings of the 19th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 4--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Almeida, L. and Pedreiras, P. 2004. Scheduling within temporal partitions: response-time analysis and server design. In EMSOFT '04: Proceedings of the 4th ACM International Conference on Embedded Software. ACM Press, New York. 95--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Baruah, S., Howell, R., and Rosier, L. 1990a. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. J. Real-Time Syst. 2, 301--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Baruah, S., Mok, A., and Rosier, L. 1990b. Preemptively scheduling hard-real-time sporadic tasks on one processor. In RTSS '90: Proceedings of the 11th IEEE Real-Time Systems Symposium. 182--190.Google ScholarGoogle Scholar
  5. Bernat, G., Burns, A., and Llamosi, A. 2001. Weakly hard real-time systems. IEEE Trans. Comput. 50, 4, 308--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Deng, Z. and Liu, J. W.-S. 1997. Scheduling real-time applications in an open environment. In RTSS '97: Proceedings of the 18th IEEE Real-Time Systems Symposium. 308--319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Feng, X. 2004. Design of real-time virtual resource architecture for large-scale embedded systems. Ph.D. thesis, University of Texas, Austin, TX. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Feng, X. A. and Mok, A. K. 2002. A model of hierarchical real-time virtual resources. In RTSS '02: Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02). IEEE Computer Society, Los Alamitos, CA. 26--35. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Goyal, P., Guo, X., and Vin, H. M. 1996. A hierarchical CPU scheduler for multimedia operating systems. In Usenix Association Second Symposium on Operating Systems Design and Implementation (OSDI). 107--121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hamdaoui, M. and Ramanathan, P. 1995. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Trans. Comput. 44, 12, 1443--1451. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Henzinger, T. A., Horowitz, B., and Kirsch, C. M. 2003. Giotto: A time-triggered language for embedded programming. Proc. IEEE 91, 84--99.Google ScholarGoogle ScholarCross RefCross Ref
  12. Kuo, T.-W. and Li, C.-H. 1999. A fixed-priority-driven open environment for real-time applications. In RTSS '99: Proceedings of the 20th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 256--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Lehoczky, J. and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of IEEE Real-Time Systems Symposium. 110--123.Google ScholarGoogle Scholar
  14. Lehoczky, J. P., Sha, L., and Strosnider, J. K. 1987. Enhanced aperiodic responsiveness in hard real-time environments. In RTSS '87: Proceedings of 8th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 261--270.Google ScholarGoogle Scholar
  15. Lehoczky, J., Sha, L., and Ding, Y. 1989. The rate monotonic scheduling algorithm: exact characterization and average case behavior. In RTSS '89: Proceedings of the 10th IEEE Real-Time Systems Symposium. 166--171.Google ScholarGoogle Scholar
  16. Lipari, G. and Baruah, S. 2000. Efficient scheduling of real-time multi-task applications in dynamic systems. In Proceedings of the IEEE. 166--175. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Lipari, G. and Bini, E. 2003. Resource partitioning among real-time applications. In ECRTS '03: Proceedings of 15th Euromicro Conference on Real-Time Systems. 151--158.Google ScholarGoogle Scholar
  18. Lipari, G., Carpenter, J., and Baruah, S. 2000. A framework for achieving inter-application isolation in multiprogrammed hard-real-time environments. In RTSS '00: Proceedings of the 21st IEEE Real-Time Systems Symposium. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Liu, C. and Layland, J. 1973. Scheduling algorithms for multi-programming in a hard-real-time environment. J. ACM 20, 1, 46--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Mathworks. 2005. Models with multiple sample rates. In Real-Time Workshop User Guide. 1--34.Google ScholarGoogle Scholar
  21. Matic, S. and Henzinger, T. A. 2005. Trading end-to-end latency for composability. In RTSS '05: Proceedings of the 26th IEEE Real-Time Systems Symposium. 99--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Mok, A., Feng, X., and Chen, D. 2001. Resource partition for real-time systems. In RTAS '01: Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium. 75--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Rajkumar, R., Sha, L., and Lehoczky, J. P. 1988. Real-time synchronization protocols for multiprocessors. In RTSS '88: Proceedings of the 9th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 259--269.Google ScholarGoogle Scholar
  24. Regehr, J. and Stankovic, J. 2001. HLS: A framework for composing soft real-time schedulers. In RTSS '01: Proceedings of the 22nd IEEE Real-Time Systems Symposium. 3--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Saewong, S., Rajkumar, R. R., Lehoczky, J. P., and Klein, M. H. 2002. Analysis of hierarhical fixed-priority scheduling. In ECRTS '02: Proceedings of the 14th Euromicro Conference on Real-Time Systems. IEEE Computer Society, Los Alamitos, CA. 173--181. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Sha, L., Lehoczky, J. P., and Rajkumar, R. 1987. Task scheduling in distributed real-time systems. In Proceedings of the International Conference on Industrial Electronics, Control, and Instrumentation. Cambridge, MA. 909--916.Google ScholarGoogle Scholar
  27. Shin, I. and Lee, I. 2003. Periodic resource model for compositional real-time guarantees. In RTSS '03: Proceedings of the 24th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Shin, I. and Lee, I. 2004. Compositional real-time scheduling framework. In RTSS '04: Proceedings of the 25th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 57--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Sprunt, B., Sha, L., and Lehoczky, J. P. 1989. Aperiodic task scheduling for hard real-time systems. Real-Time Syst. 1, 1 (June), 27--60.Google ScholarGoogle ScholarCross RefCross Ref
  30. Spuri, M. and Buttazzo, G. C. 1994. Efficient aperiodic service under earliest deadline scheduling. In RTSS '94: Proceedings of the 15th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 2--11.Google ScholarGoogle Scholar
  31. Strosnider, J. K., Lehoczky, J. P., and Sha, L. 1995. The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Comput. 44, 1 (Jan.), 73--91. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Compositional real-time scheduling framework with periodic model

        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!