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.
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- S. Baruah, R. Howell, and L. Rosier. 1993. Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118, 1, 3--20. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Farhana Dewan and Nathan Fisher. 2012a. Bandwidth allocation for fixed-priority-scheduled compositional real-time systems (extended version). Tech. rep. Wayne State University.Google Scholar
- 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 Scholar
Digital Library
- Arvind Easwaran. 2007 Compositional schedulability analysis supporting associativity, optimality, dependency and concurrency. Ph.D. Dissertation. University of Pennsylvania, Philadelphia, PA.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Insik Shin and Insup Lee. 2008. Compositional real-time scheduling framework with periodic model. ACM Trans. Embed. Comput. Syst. 7, 3. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Index Terms
Bandwidth allocation for fixed-priority-scheduled compositional real-time systems
Recommendations
Fixed-Priority Schedulability of Arbitrary-Deadline Sporadic Tasks upon Periodic Resources
RTCSA '12: Proceedings of the 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsSchedulability for compositional real-time systems has been the focus of a great deal of recent research. In this problem domain, we consider the fixed-priority (FP) scheduling of arbitrary-deadline sporadic task systems upon periodic resources. ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Preference-Oriented Fixed-Priority Scheduling for Real-Time Systems
DASC '14: Proceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure ComputingMost real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle them when they have different execution preferences. In this paper, for a set of periodic tasks, where some tasks are preferably ...






Comments