skip to main content
research-article

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems

Published:10 March 2014Publication History
Skip Abstract Section

Abstract

Recent research in compositional real-time systems has focused on determination of a component's real-time interface parameters. An important objective in interface-parameter determination is minimizing the bandwidth allocated to each component of the system while simultaneously guaranteeing component schedulability. With this goal in mind, in this article, we explore fixed-priority schedulability in compositional setting. First we derive an efficient exact test based on iterative convergence for sporadic task systems scheduled by fixed-priority (e.g., deadline monotonic, rate monotonic) upon an explicit-deadline periodic (EDP) resource. Then we address the time complexity of the exact test by developing a fully-polynomial-time approximation scheme (FPTAS) for allocating bandwidth to components. Our parametric algorithm takes the task system and an accuracy parameter ε > 0 as input and returns a bandwidth which is guaranteed to be at most a factor (1 + ε) times the optimal minimum bandwidth required to successfully schedule the task system. We perform thorough simulation over synthetically generated task systems to compare the performance of our proposed efficient-exact and the approximate algorithm and observe a significant decrease in runtime and a very small relative error when comparing the approximate algorithm with the exact algorithm and the sufficient algorithm.

References

  1. Masud Ahmed, Nathan Fisher, Shengquan Wang, and Pradeep Hettiarachchi. 2011. Minimizing peak temperature in embedded real-time systems via thermal-aware periodic resources. Sustain. Comput. Inf. Syst. 1, 3, 226--240.Google ScholarGoogle ScholarCross RefCross Ref
  2. Karsten Albers, Frank Bodmann, and Frank Slomka. 2008. Advanced Hierarchical event-stream model. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society, 211--220. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Luis Almeida and Paulo Pedreiras. 2004. Scheduling within temporal partitions: Response-time analysis and server design. In Proceedings of the 4th ACM International Conference on Embedded Software. ACM, New York, NY, 95--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. 1993. Applying new scheduling theory to static priority preemptive scheduling. Softw. Eng. J. 8, 5, 285--292.Google ScholarGoogle ScholarCross RefCross Ref
  5. N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. 1991. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of the 8th IEEE Workshop on Real-Time Operating Systems and Software. 127--132.Google ScholarGoogle Scholar
  6. S. Baruah, R. Howell, and L. Rosier. 1993. Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118, 1, 3--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Bernat and A. Burns. 1999. New results on fixed priority aperiodic servers. In Proceedings of the IEEE Real-Time Systems Symposium. 68--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Enrico Bini and Sanjoy Baruah. 2007. Efficient computation of response time bounds under fixed-priority scheduling. In Proceedings of the 15th International Conference on Real-Time Systems. 95--104.Google ScholarGoogle Scholar
  9. E. Bini and G. Buttazzo. 2004. Biasing effects in schedulability measures. In Proceedings of the 16th Euromicro Conference on Real-Time Systems. IEEE Computer Society, 196--203. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. I. Davis, A. Zabos, and A. Burns. 2008. Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57, 9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Z. Deng and J. Liu. 1997. Scheduling real-time applications in an open environment. In Proceedings of the 18th IEEE Real-Time Systems Symposium. IEEE Computer Society, 308--319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Farhana Dewan and Nathan Fisher. 2010. Approximate bandwidth allocation for fixed-priority-scheduled periodic resources. In Proceedings of the 16th IEEE Real-Time Technology and Applications Symposium (RTAS). IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Farhana Dewan and Nathan Fisher. 2012a. Bandwidth allocation for fixed-priority-scheduled compositional real-time systems (extended version). Tech. rep. Wayne State University.Google ScholarGoogle Scholar
  14. Farhana Dewan and Nathan Fisher. 2012b. Fixed-priority schedulability of arbitrary-deadline sporadic tasks upon periodic resources. In Proceedings of the IEEE 18th International Conference on Embedded and Real-Time Computing System and Applications. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Arvind Easwaran. 2007 Compositional schedulability analysis supporting associativity, optimality, dependency and concurrency. Ph.D. Dissertation. University of Pennsylvania, Philadelphia, PA.Google ScholarGoogle Scholar
  16. Arvind Easwaran, Madhukar Anand, and Insup Lee. 2007. Compositional analysis framework using EDP resource models. In Proceedings of the IEEE Real-time Systems Symposium. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Arvind Easwaran, Insup Lee, Oleg Sokolsky, and Steve Vestal. 2009. A compositional scheduling framework for digital avionics systems. In Proceedings of the International Workshop on Real-Time Computing Systems and Applications. 371--380. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Xiang (Alex) Feng and Al Mok. 2002. A model of hierarchical real-time virtual resources. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 26--35. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Nathan Fisher. 2009. An FPTAS for interface selection in the periodic resource model. In Proceedings of the 17th International Conference on Real-Time and Network Systems.Google ScholarGoogle Scholar
  20. Nathan Fisher and Sanjoy Baruah. 2005. A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Nathan Fisher and Farhana Dewan. 2012. A bandwidth allocation scheme for compositional real-time systems with periodic resources. Real-Time Syst. 48, 3, 223--263. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Pradeep M. Hettiarachchi, Nathan Fisher, Masud Ahmed, Le Yi Wang, Shinan Wang, and Weisong Shi. 2012. The design and analysis of thermal-resilient hard-real-time systems. In Proceeding of the IEEE Real-Time and Embedded Technology and Applications Symposium. 67--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Lehoczky, L. Sha, and Y. Ding. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium. IEEE Computer Society, 166--171.Google ScholarGoogle Scholar
  24. J. Lehoczky, L. Sha, and J. Stronider. 1987. Enhanced aperiodic responsiveness in hard real-time environments. In Proceedings of the Real-Time Systems Symposium. IEEE, 261--270.Google ScholarGoogle Scholar
  25. J. Leung and J. Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2, 4, 237--250.Google ScholarGoogle ScholarCross RefCross Ref
  26. Giuseppe Lipari and Enrico Bini. 2003. Resource partitioning among real-time applications. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society, 151--160.Google ScholarGoogle ScholarCross RefCross Ref
  27. A. Mok. 1988. Task management techniques for enforcing ED scheduling on a periodic task set. In Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems. 42--46.Google ScholarGoogle Scholar
  28. A. K. Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. Dissertation. Laboratory for Computer Science, Massachusetts Institute of Technology. (Tech. rep. No. MIT/LCS/TR-297.) Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. C. Okwudire, M. van den Heuvel, R. Bril, and J. Lukkien. 2010. Exploiting harmonic periods to improve linearly approximated response-time upper bounds. In Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation (ETFA). 1--4.Google ScholarGoogle Scholar
  30. Raj Rajkumar, Kanaka Juvva, Anastasio Molano, and Shuichi Oikawa. 2001. Resource kernels: A resource-centric approach to real-time and multimedia systems. In Readings in Multimedia Computing and Networking, Morgan Kaufmann Publishers Inc., San Francisco, CA, 476--490. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Insik Shin, Arvind Easwaran, and Insup Lee. 2008. Hierarchical scheduling framework for virtual clustering of multiprocessors. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Insik Shin and Insup Lee. 2003. Periodic resource model for compositional real-time guarantees. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 2--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Insik Shin and Insup Lee. 2004. Compositional real-time scheduling framework. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 57--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Insik Shin and Insup Lee. 2008. Compositional real-time scheduling framework with periodic model. ACM Trans. Embed. Comput. Syst. 7, 3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Mikael Sjödin and Hans Hansson. 1998. Improved response-time analysis calculations. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS). 399--408. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. B. Sprunt, J. Lehoczky, and L. Sha. 1888 Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm. In Proceedings of the Real-Time Systems Symposium. 251--258.Google ScholarGoogle Scholar
  37. B. Sprunt, L. Sha, and J. P. Lehoczky. 1989. Aperiodic task scheduling for hard real-time systems. Real-Time Syst. 1, 1, 27--69.Google ScholarGoogle ScholarCross RefCross Ref
  38. J. Strosnider, J. Lehoczky, and L. Sha. 1995. The deferrable server algorithm for enhancing aperiodic responsiveness in hard-real-teime environments. IEEE Trans. Comput. 44, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Martijn M. M. H. P. van den Heuvel, Pieter J. L. Cuijpers, Johan J. Lukkien, and Nathan Fisher. 2012. Revised budget allocations for fixed-priority-scheduled periodic resources. CS-report 12-03, Technische Universiteit Eindhoven (TU/e).Google ScholarGoogle Scholar

Index Terms

  1. Bandwidth allocation for fixed-priority-scheduled compositional 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!