ACM Home Page
Please provide us with feedback. Feedback
Robust and sustainable schedulability analysis of embedded software
Full text PdfPdf (468 KB)
Source
Language, Compiler and Tool Support for Embedded Systems archive
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems table of contents
Tucson, AZ, USA
SESSION: Timing analysis and compiler optimization table of contents
Pages 61-70  
Year of Publication: 2008
ISBN:978-1-60558-104-0
Also published in ...
Authors
Madhukar Anand  University of Pennsylvania, Philadelphia, PA, USA
Insup Lee  University of Pennsylvania, Philadelphia, PA, USA
Sponsors
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
SIGDA: ACM Special Interest Group on Design Automation
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 88,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1375657.1375666
What is a DOI?

ABSTRACT

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
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
 
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
 
14
 
15
 
16
 
17
18
 
19
Daniel Iercan. TSL Compiler. Master's thesis, Politehnica University of Timisoara, September 2005.
20
 
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. doi: 10.1109/ICSI.1992.217244.
 
24
 
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. doi: 10.1109/ICDCS.1994.302407.
 
26
 
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. doi: 10.1109/EMWRTS.1995.514297.
 
28

Collaborative Colleagues:
Madhukar Anand: colleagues
Insup Lee: colleagues