Robust and sustainable schedulability analysis of embedded software
Authors: 
Madhukar Anand, 
Insup LeeAuthors Info & Claims
Madhukar Anand, Insup LeeAuthors Info & ClaimsAbstract
For real-time systems, most of the analysis involves efficient or exact schedulability checking. While this is important, analysis is often based on the assumption that the task parameters such as execution requirements and inter-arrival times between jobs are known exactly. In most cases, however, only a worst-case estimate of these quantities is available at the time of analysis. It is therefore imperative that schedulability analysis hold for better parameter values (Sustainable Analysis). On the other hand, if the task or system parameters turn out to be worse off, then the analysis should tolerate some deterioration (Robust Analysis). Robust analysis is especially important, because the implication of task schedulability is often weakened in the presence of optimizations that are performed on its code, or dynamic system parameters.
In this work, we define and address sustainability and robustness questions for analysis of embedded real-time software that is modeled by conditional real-time tasks. Specifically, we show that, while the analysis is sustainable for changes in the task such as lower job execution times and increased relative deadlines, it is not the case for code changes such as job splitting and reordering. We discuss the impact of these results in the context of common compiler optimizations, and then develop robust schedulability techniques for operations where the original analysis is not sustainable.
References
[1]
A.K. Mok and Wing-Chi Poon. Non-preemptive robustness under reduced system load. Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International, pages 10 pp.--, 5-8 Dec. 2005. ISSN 1052-8725.
[2]
K. Altisen, G. Gössler, and J. Sifakis. Scheduler modeling based on the controller synthesis paradigm. Real-Time Syst., 23(1-2):55--84, 2002. ISSN 0922-6443.
[3]
Madhukar Anand, Arvind Easwaran, Sebastian Fischmeister, and Insup Lee. Compositional feasibility analysis for conditional task models. In Proceedings of the Eleventh IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC'08), Washington DC, USA, 2008. IEEE Computer Society.
[4]
J. Andersson, B.; Jonsson. Preemptive multiprocessor scheduling anomalies. Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM, pages 12--19, 2002.
[5]
Sanjoy Baruah and Alan Burns. Sustainable scheduling analysis. In RTSS'06: Proceedings of the 27th IEEE International Real-Time Systems Symposium, pages 159--168, Washington, DC, USA, 2006. IEEE Computer Society. ISBN 0-7695-2761-2.
[6]
Sanjoy K. Baruah. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Systems, 24(1):93--128, 2003. ISSN 0922-6443.
[7]
Sanjoy K. Baruah. A general model for recurring real-time tasks. In RTSS, pages 114--122, 1998. URL citeseer.ist.psu.edu/baruah98general.html.
[8]
Hanene Ben-Abdallah, Jin-Young Choi, Duncan Clarke, Young Si Kim,Insup Lee, and Hong-Liang Xie. A process algebraic approach to the schedulability analysis of real-time systems. Real-Time Syst., 15(3):189--219, 1998. ISSN 0922-6443.
[9]
Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, New York, NY, USA, 2004. ISBN 0521833787.
[10]
Alan Burns and Sanjoy Baruah. Sustainability in real-time scheduling. Journal of Computing Science and Engineering, Vol 2(No. 1):72--94, 2008.
[11]
G. Buttazzo. Achieving scalability in real-time systems. Computer, 39(5): 54--59, May 2006. ISSN 0018-9162.
[12]
G. C. Buttazzo and J. Stankovic. Red: A robust earliest deadline scheduling algorithm. In Proceedings of Third International Workshop on Responsive Computing Systems, 1993. URL citeseer.ist.psu.edu/buttazzo93red.html.
[13]
Ya-Shu Chen, Li-Pin Chang, Tei-Wei Kuo, and Aloysius K. Mok. Real-time task scheduling anomaly: observations and prevention. In SAC '05: Proceedings of the 2005 ACM symposium on Applied computing, pages 897--898, New York, NY, USA, 2005. ACM. ISBN 1-58113-964-0.
[14]
http://doi.acm.org/10.1145/1066677.1066881.
[15]
A. Davis, R. I.; Burns. Robust priority assignment for fixed priority real-time systems. Real-Time Systems Symposium, 2007. RTSS 2007. 28th IEEE International, pages 3--14, 3-6 Dec. 2007. ISSN 1052-8725.
[16]
X. Feng and A. Mok. A model of hierarchical real-time virtual resources. In Proc. of IEEE Real-Time Systems Symposium, pages 26--35, December 2002.
[17]
Christian Ferdinand, Reinhold Heckmann, Marc Langenbach, Florian Martin, Michael Schmidt, Henrik Theiling, Stephan Thesing, and Reinhard Wilhelm. Reliable and precise wcet determination for a real-life processor. In EMSOFT '01: Proceedings of the First International Workshop on Embedded Software, pages 469--485, London, UK, 2001. Springer-Verlag. ISBN 3-540-42673-6.
[18]
Arkadeb Ghosal, Alberto Sangiovanni-Vincentelli, Christoph M. Kirsch,Thomas A. Henzinger, and Daniel Iercan. A hierarchical coordination language for interacting real-time tasks. In EMSOFT '06: Proceedings of the 6th ACM & IEEE International conference on Embedded software, pages 132--141. ACM Press, 2006. ISBN 1-59593-542-8.
[19]
Daniel Iercan. TSL Compiler. Master's thesis, Politehnica University of Timisoara, September 2005.
[20]
Sheayun Lee, Insik Shin, Woonseok Kim, Insup Lee, and Sang L. Min. A design framework for real-time embedded systems with code size and energy constraints. (To appear) ACM Transactions on Embedded Computing Systems (TECS), 2008.
[21]
J.Y.T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2:37--250, 1982.
[22]
G. Lipari and E. Bini. Resource partitioning among real-time applications. In Proc. of Euromicro Conference on Real-Time Systems, July 2003.
[23]
S.P. Marlowe, T.J.; Masticola. Safe optimization for hard real-time programming. Systems Integration, 1992. ICSI '92., Proceedings of the Second International Conference on, pages 436--445, 15-18 Jun 1992.
[24]
Razvan Racu and Rolf Ernst. Scheduling anomaly detection and optimization for distributed systems with preemptive task-sets. In RTAS '06: Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), pages 325--334, 2006. ISBN 0-7695-2516-4.
[25]
Ha Rhan and J.W.S. Liu. Validating timing constraints in multiprocessor and distributed real-time systems. Distributed Computing Systems,1994., Proceedings of the 14th International Conference on, pages 162--171, 21-24 Jun 1994.
[26]
I. Shin and I. Lee. Periodic resource model for compositional real-time guarantees. In Proc. of IEEE Real-Time Systems Symposium, pages 2--13, December 2003.
[27]
R. Yerraballi, R. Mukkamala, K. Maly., and H.A. Wahab. Issues in schedulability analysis of real-time systems. Real-Time Systems, 1995. Proceedings., Seventh Euromicro Workshop on, pages 87--92, 14-16 Jun 1995.
[28]
M.F. Younis, Marlowe T.J., Tsai G., and Stoyenko A.D. Toward compiler optimization of distributed real-time processes. Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on, pages 35--42, 21-25 Oct 1996. 1996.558328.
Index Terms
- Robust and sustainable schedulability analysis of embedded software
Recommendations
Robust and sustainable schedulability analysis of embedded software
LCTES '08: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systemsFor real-time systems, most of the analysis involves efficient or exact schedulability checking. While this is important, analysis is often based on the assumption that the task parameters such as execution requirements and inter-arrival times between ...
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 EDF-scheduled embedded real-time systems with resource sharing
Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In the existing literature, however, there is no complete exact analysis for EDF scheduling when both resource sharing and ...
Comments
Information & Contributors
Information
Published In
June 2008180 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 June 2008
Published in SIGPLAN Volume 43, Issue 7
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations3Total Citations
- 310Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in