ACM Home Page
Please provide us with feedback. Feedback
Program path analysis to bound cache-related preemption delay in preemptive real-time systems
Full text PdfPdf (180 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the eighth international workshop on Hardware/software codesign table of contents
San Diego, California, United States
Pages: 67 - 71  
Year of Publication: 2000
ISBN:1-58113-268-9
Authors
Hiroyuki Tomiyama  Center for Embedded Computer Systems, University of California, Irvine, CA
Nikil D. Dutt  Center for Embedded Computer Systems, University of California, Irvine, CA
Sponsors
Computer Conservation Society : Computer Conservation Society
IFIP WG 10.5 : IFIP WG 10.5
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Unpredictable behavior of cache memory males it difficult to statically analyze the worst-case performance of real-time systems. This problem is exacerbated in case of preemptive multitask systems due to intertask cache in terference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analysis of the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method determines the program execution path of the task which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a previous approach.


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
R. D. Arnold, F. Mueller, D. B. Whalley, and M. G. Harmon, "Bounding worst-case instruction cache performance," In Proc. of Real-Time Systems Symp., pp. 172-181, 1994.
 
2
 
3
 
4
 
5
D. B. Kirk, "SMART (strategic memory allocation for real-time) cache design," In Proc. of Real-Time Systems Symp., pp. 97-108, 1989.
 
6
 
7
 
8
Y.-T. S. Li and S. Malik, "Performance analysis of embedded software using implicit path enumeration," IEEE Trans. CAD/ICAS, vol. 16, no. 12, pp. 1477-1487, December 1997.
 
9
10
11
 
12
 
13
SNU Real-Time Benchmarks, http://archi.snu.ac.kr/realtime/benchmark.
 
14
 
15
 
16
H. Yasuura, H. Tomiyama, A. Inoue, and F. N. Eko, "Embedded system design using soft-core processor and Valen-C," IIS Journal of Information Science and Engineering, vol. 14, no. 3, pp. 587-603, September 1998.


Collaborative Colleagues:
Hiroyuki Tomiyama: colleagues
Nikil D. Dutt: colleagues