Abstract
Real-time multimedia subsystems often require support for switching between different resource and application execution modes. To ensure that timing constraints are not violated during or after a subsystem mode change, real-time schedulability analysis is required. However, existing time-efficient multimode schedulability analysis techniques for application-only mode changes are not appropriate for subsystems that require changes in the resource execution behavior (e.g., processors with dynamic power modes). Furthermore, all existing multimode schedulability analysis that handles both resource and application mode changes is highly exponential and not scalable for subsystems with a moderate or large number of modes. As a result, the notion of resource optimality is still unaddressed for real-time multimodal systems. In this report, we first address the lack of tractable schedulability analysis for such subsystems by proposing a model for characterizing multiple resource and application modes and by deriving a sufficient schedulability test that has pseudo-polynomial time complexity. Finally, we propose an algorithm which leverages this pseudo-polynomial schedulability analysis to optimize the resource usages (e.g., to minimize peak-power load) of a multimodal real-time system. Simulation results show that our proposed algorithms for schedulability analysis and resource allocation, when compared with previously-proposed approaches, require significantly less time and are just as precise.
- Luca Abeni and Giorgio Buttazzo. 1998. Integrating multimedia applications in hard real-time systems. In Proceedings of the Real-Time Systems Symposium. IEEE Computer Society Press. Google Scholar
Digital Library
- Masud Ahmed, Nathan Fisher, and Daniel Grosu. 2012. A parallel algorithm for EDF-schedulability analysis of multi-modal real time systems. In Proceedings of the 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. Google Scholar
Digital Library
- 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. Inform. Syst. 1, 3, 226--240.Google Scholar
Cross Ref
- S. Baruah, R. Howell, and L. Rosier. 1990a. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst. Int. J. Time-Critical Comput. Google Scholar
Digital Library
- S. Baruah, A. Mok, and L. Rosier. 1990b. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium.Google Scholar
- S. Baruah, R. Howell, and L. Rosier. 1993. Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 1. Google Scholar
Digital Library
- S. Brandt, S. Banachowski, C. Lin, and T. Bisson. 2003. Dynamic integrated scheduling of hard real-time, soft real-time and non-real-time processes. In Proceedings of the 24th IEEE Real-Time Systems Symposium. Google Scholar
Digital Library
- Giorigo Buttazzo and Luca Abeni. 2000. Adaptive rate control through elastic scheduling. In Proceedings of the 24th IEEE Conference on Decision and Control.Google Scholar
Cross Ref
- Arvind Easwaran, Madhukar Anand, and Insup Lee. 2007. Compositional analysis framework using EDP resource models. In Proceedings of the IEEE Real-Time Systems Symposium. Google Scholar
Digital Library
- Nathan Fisher and Masud Ahmed. 2011. Tractable Real-Time Schedulability Analysis for Resource and Application Mode Changes under Temporal Isolation (Extended Version). Technical Report. Wayne State University. http://www.cs.wayne.edu/∼fishern/papers/MC-tech-report.pdf.Google Scholar
- Pradeep 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 Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). Google Scholar
Digital Library
- Jinhwan Kim, Inhwan Jung, and Bonggyou Lee. 2002. A scheduling technique based on the variable bandwidth server for multimedia systems. In Proceedings of the IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering.Google Scholar
- C. Liu and J. Layland. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 1 (1973). Google Scholar
Digital Library
- A. K. Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph. D. dissertation. Laboratory for Computer Science, MIT.Google Scholar
- Vincent Nelis and Joel Goossens. 2009. Mode change protocol for multi-mode real-time systems upon identical multiprocessors. In Proceedings of the Euromicro Conference on Real-Time Systems.Google Scholar
- Vincent Nelis, Joel Goossens, and Bjorn Andersson. 2008. Two protocols for scheduling multi-mode real-time systems upon identical multiprocessor platforms. In Proceedings of the Euromicro Conference on Real-Time Systems. Google Scholar
Digital Library
- P. Pedro and A. Burns. 1998. Schedulability analysis for mode changes in flexible real-time systems. In Proceedings of the 10th Euromicro Workshop on Real-Time Systems. DOI: http://dx.doi.org/10.1109/EMWRTS.1998.685082.Google Scholar
- L. T. X. Phan, S. Chakraborty, and I. Lee. 2009. Timing analysis of mixed time/event-triggered multi-mode systems. In Proceedings of the IEEE Real-Time Systems Symposium. DOI: http://dx.doi.org/10.1109/RTSS.2009.24. Google Scholar
Digital Library
- L. T. X. Phan, Insup Lee, and O. Sokolsky. 2010. Compositional analysis of multi-mode systems. In Proceedings of the 22nd Euromicro Conference on Real-Time Systems (ECRTS). DOI: http://dx.doi.org/10.1109/ECRTS.2010.35. Google Scholar
Digital Library
- Guangming Qian. 2009. An earlier time for inserting and/or accelerating tasks. Real-Time Syst. 41, 3, 181--194. Google Scholar
Digital Library
- Jorge Real and Alfons Crespo. 2004. Mode change protocols for real-time systems: A survey and a new proposal. Real-Time Syst. 26, 2 (2004), 161--197. http://portal.acm.org/citation.cfm?id=969960.969963. Google Scholar
Digital Library
- Luca Santinelli, Giorgio Buttazzo, and Enrico Bini. 2011. Multi-moded resource reservations. In Proceedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). DOI: http://dx.doi.org/10.1109/RTAS.2011.12. Google Scholar
Digital Library
- Lui Sha, Ragunathan Rajkumar, John Lehoczky, and Krithi Ramamritham. 1988. Mode change protocols for priority-driven preemptive scheduling. Real-Time Syst. 1, 3 (1988), 243--264.Google Scholar
Cross Ref
- Insik Shin and Insup Lee. 2008. Compositional real-time scheduling framework with periodic model. ACM Trans. Embed. Comput. Syst. 7, 3, 30--69. Google Scholar
Digital Library
- 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
- Nikolay Stoimenov, Simon Perathoner, and Lothar Thiele. 2009. Reliable mode changes in real-time systems with fixed priority or EDF scheduling. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE). 6. Google Scholar
Digital Library
- Nikolay Stoimenov, Lothar Thiele, Luca Santinelli, and Giorgio Buttazzo. 2010. Resource adaptations with servers for hard real-time systems. In Proceedings of the 10th ACM International Conference on Embedded Software. Google Scholar
Digital Library
- K. W. Tindell, A. Burns, and A. J. Wellings. 1992. Mode changes in priority preemptively scheduled systems. In Proceedings of the IEEE Real-Time Systems Symposium. DOI: http://dx.doi.org/10.1109/REAL.1992.242672.Google Scholar
Cross Ref
- K. W. Tindell and A. Alonso. 1996. A very simple protocol for mode changes in priority preemptive systems. Tech. rep., Universidad Politecnica de Madrid.Google Scholar
Index Terms
Tractable schedulability analysis and resource allocation for real-time multimodal systems
Recommendations
Resource Reclaiming in Multiprocessor Real-Time Systems
Most real-time scheduling algorithms schedule tasks with regard to their worst casecomputation times. Resources reclaiming refers to the problem of utilizing the resourcesleft unused by a task when it executes in less than its worst case computation ...
A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems
To engineer reliable real-time systems, it is desirable to detect timing anomalies early in the development process. However, there is little work addressing the problem of accurately predicting timing properties of real-time systems before implementations ...
Model-based schedulability analysis of safety critical hard real-time Java programs
JTRES '08: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systemsIn this paper, we present a novel approach to schedulability analysis of Safety Critical Hard Real-Time Java programs. The approach is based on a translation of programs, written in the Safety Critical Java profile introduced in [21] for the Java ...






Comments