ACM Home Page
Please provide us with feedback. Feedback
Performance estimation of embedded software with instruction cache modeling
Full text Publisher SitePublisher Site PdfPdf (145 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 380 - 387  
Year of Publication: 1995
ISBN:0-8186-7213-7
Authors
Yau-Tsun Steven Li  Department of Electrical Engineering, Princeton University, Princeton, NJ
Sharad Malik  Department of Electrical Engineering, Princeton University, Princeton, NJ
Andrew Wolfe  Department of Electrical Engineering, Princeton University, Princeton, NJ
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Embedded systems generally interact with the outside world. Thus, some real-time constraints may be imposed on the system design. Verification of these constraints requires computing a tight upper bound on the worst case execution time (WCET) of a hardware/software system. The problem of bounding WCET is particularly difficult on modern processors, which use cache-based memory systems that vary memory access time significantly. This must be accurately modeled in order to tightly bound WCET. Existing approaches either search all possible program paths, an intractable problem, or they use pessimistic assumptions to limit the search space. In this paper we present a far more effective and accurate method for modeling instruction cache activity and computing a tight bound on WCET. It is implemented in the program \texttt{cinderella}. We present some preliminary results of using this tool on sample embedded programs.


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
Jyh-Charn Liu and Hung-Ju Lee, "Deterministic upperbounds of the worst-case execution times of cached programs", in Proceedings of the 15th IEEE Real-Time Systems Symposium, December 1994, pp. 182-191.
 
4
Sung-Soo Lira, Young Hyun Bae, Gyu Tae Jang, Byung- Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, and Chong Sang Kim, "An accurate worst case timing analysis technique for RISC processors", in Proceedings of the 15th IEEE Real-Time Systems Symposium, December 1994, pp. 97-108.
 
5
 
6
Robert Arnold, Frank Mueller, David Whalley, and Marion Harmon, "Bounding worst-case instruction cache performance", in Proceedings of the 15th IEEE Real-Time Systems Symposium, December 1994, pp. 172-181.
 
7
Jai Rawat, "Static analysis of cache performance for realtime programming", Master's thesis, Iowa State University of Science and Technology, November 1993, TR93-19.
 
8
Intel Corporation, QT960 User Manual, 1990, Order Number 270875-001.
 
9
Intel Corporation, i960KA/KB Miclvprocessor Programmers's Reference Manual, 1991, ISBN 1-55512-137-3.
 
10
 
11
Chang Yun Park, Predicting Deterministic Execution Times of Real-Time Programs, PhD thesis, University of Washington, Seattle 98195, August 1992.
 
12
Rajesh Kumar Gupta, Co-Synthesis of Hardware and Software for Digital Embedded Systems, PhD thesis, Stanford University, December 1993.

CITED BY  32

Collaborative Colleagues:
Yau-Tsun Steven Li: colleagues
Sharad Malik: colleagues
Andrew Wolfe: colleagues