ACM Home Page
Please provide us with feedback. Feedback
Schedulability-driven performance analysis of multiple mode embedded real-time systems
Full text PdfPdf (108 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 495 - 500  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Youngsoo Shin  Center for Collaborative Research and Institute of Industrial Science, University of Tokyo, Tokyo 106-8558, Japan
Daehong Kim  School of Electrical Engineering, Seoul National University, Seoul 151-742, Korea
Kiyoung Choi  School of Electrical Engineering, Seoul National University, Seoul 151-742, Korea
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/337292.337556
What is a DOI?

ABSTRACT

Providing multiple modes to support dynamically changing environments, standards, and new services is prevalent in embedded systems, especially in mobile radio systems. Because such a system frequently contains time-constrained tasks, it is important to analyze the temporal requirements as well as the functional correctness. This paper presents a method to analyze temporal requirements imposed on an embedded real-time system supporting multiple modes. While most performance analysis methods focus only on testing the feasibility of a task or a system, our method goes further by addressing the problem of locating hot spots of a system thereby helping the designer to choose among alternative designs or architectures. We formally define the analysis problem and show that it is very unlikely to be solved efficiently. We present a heuristic algorithm, which is accurate and fast enough to be used in iterative processes in system-level analysis and design. The analysis problem is extended to accommodate probabilistic behavior exhibited by soft real-time tasks.


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
J. Mitola, "The software radio architecture," IEEE Communications Magizine, pp. 26-38, May 1995.
 
2
W. Tuttlebee, "The impact of software radio," in Proc. Software Radio Workshop, May 1997.
 
3
 
4
 
5
R. Gerber and S. Hong, "Semantics-based compiler transformations for enhanced schedulability," in Proc. IEEE Real-Time Systems Symposium, Dec. 1993.
 
6
G. Arora and D. Stewart, "AFTER: A CASE tool to assist in fine-tuning of embedded real-time systems," in Proc. IEEE Real-Time Systems Symposium, Dec. 1996.
 
7
P. Pedro and A. Burns, "Schedulability analysis for mode changes in flexible real-time systems," in P~vc. Eu~vmic~v Workshop on Real-Time Systems, pp. 17- 19, June 1998.
8
9
10
 
11
 
12
 
13
 
14
 
15
J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: Exact characterization and average case behavior," in P~vc. IEEE Real-Time Systems Symposium, pp. 166-171, Dec. 1989.
 
16
 
17
 
18

CITED BY  7
 
 
 

Collaborative Colleagues:
Youngsoo Shin: colleagues
Daehong Kim: colleagues
Kiyoung Choi: colleagues

Peer to Peer - Readers of this Article have also read: