Abstract
A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again. This iteration is repeated until a schedulable design is obtained. However, the schedulability analysis problem for most task models is intractable (usually co-NP hard) and, hence, such an iterative design process is often very expensive. To get around this problem, we introduce the concept of “interactive” schedulability analysis. It is based on the observation that if only a small number of system parameters are changed, then it is not necessary to rerun the full schedulability analysis algorithm, thereby making the iterative design process considerably faster. We refer to this analysis as being “interactive” because it is supposed to be run in an interactive mode. This concept is fairly general and can be applied to a wide variety of task models. In this paper, we have chosen the recurring real-time task model, because it can be used to represent realistic applications from the embedded systems domain (containing conditional branches and fine-grained deadline constraints). Our experimental results show that using our scheme can lead to more than 20× speedup for each invocation of the schedulability analysis algorithm, compared to the case where the full algorithm is run.
- Albers, K. and Slomka, F. 2004. An event stream driven approximation for the analysis of real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems, Catania, Italy. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., and Yi, W. 2003. TIMES: A tool for schedulability analysis and code generation of real-time systems. In International Workshop on Formal Modeling and Analysis of Timed Systems. Lecture Notes in Computer Science 2791, Marseille, France, Springer-Verlag, New York.Google Scholar
- Baruah, S. 1998a. Feasibility analysis of recurring branching tasks. In Proceedings of the Euromicro Workshop on Real-Time Systems, Berlin, Germany. IEEE Computer Society, Los Alamitos, CA.Google Scholar
Cross Ref
- Baruah, S. 1998b. A general model for recurring real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Baruah, S. 2003. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Systems 24, 1, 93--128. Google Scholar
Digital Library
- Baruah, S., Chen, D., Gorinsky, S., and Mok, A. 1999. Generalized multiframe tasks. Real-Time Systems 17, 1, 5--22. Google Scholar
Digital Library
- Bini, E. and Natale, M. D. 2005. Optimal task rate selection in fixed priority systems. In Proceedings of the IEEE Real-Time Systems Symposium. Miami, FL. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Buttazzo, G. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publ., Boston, MA. Google Scholar
Digital Library
- Chakraborty, S., Erlebach, T., and Thiele, L. 2001. On the complexity of scheduling conditional real-time code. In Proceedings of the International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2125. Springer, New York. Google Scholar
Digital Library
- Chakraborty, S., Erlebach, T., Künzli, S., and Thiele, L. 2002. Schedulability of event-driven code blocks in real-time embedded systems. In Proceedings of the Design Automation Conference, New Orleans, LA. ACM, New York. Google Scholar
Digital Library
- Chakraborty, S., Künzli, S., and Thiele, L. 2002. Approximate schedulability analysis. In Proceedings of the IEEE Real-Time Systems Symposium. Austin, TX. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Esser, R. and Janneck, J. W. 2001. MOSES---A tool suite for visual modeling of discrete-event systems. In IEEE International Symposium on Human-Centric Computing Languages and Environments. IEEE Computer Society, Stresa, Italy. http://www.tik.ee.ethz.ch/~moses/. Google Scholar
Digital Library
- Fisher, N. and Baruah, S. 2005. A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In Proceedings of the Euromicro Conference on Real-Time Systems, Porto, Portugal. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Hamann, A., Jersak, M., Richter, K., and Ernst, R. 2004. Design space exploration and system optimization with SymTA/S---symbolic timing analysis for systems. In IEEE Real-Time Systems Symposium, Lisbon, Portugal. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Mok, A. and Chen, D. 1997. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering 23, 10, 635--645. Google Scholar
Digital Library
- Takada, H. and Sakamura, K. 1997. Schedulability of generalized multiframe task sets under static priority assignment. In Proceedings of the International Workshop on Real-Time Computing Systems and Applications. Taipei, Taiwan. IEEE Computer Society, Los Alamitos, CA. Google Scholar
Digital Library
- Tokuda, H. and Kotera, M. 1988. Scheduler 1-2-3: An interactive schedulability analyzer for real-time systems. In Proceedings the IEEE International Computer Software and Applications Conference, Chicago, IL. IEEE Computer Society, Los Alamitos, CA.Google Scholar
Index Terms
Interactive schedulability analysis
Recommendations
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 schedulability analysis was developed for CAN, showing how worst-case response times ...
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
ECRTS '08: Proceedings of the 2008 Euromicro Conference on Real-Time SystemsIn a paper that was presented at the recently-concluded Real-Time Systems Symposium, Vestal proposed a new real-time task model that is able to represent the fact that the worst-case execution time (WCET) of a single task may be determined to different ...
Interactive Schedulability Analysis
RTAS '06: Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications SymposiumA typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a ...






Comments