| Exploiting stack distance to estimate worst-case data cache performance |
| Full text |
Pdf
(245 KB)
|
Source
|
Symposium on Applied Computing
archive
Proceedings of the 2009 ACM symposium on Applied Computing
table of contents
Honolulu, Hawaii
SESSION: Real-time systems track
table of contents
Pages: 1979-1983
Year of Publication: 2009
ISBN:978-1-60558-166-8
|
|
Authors
|
|
Yu Liu
|
Southern Illinois University Carbondale, Carbondale, IL
|
|
Wei Zhang
|
Southern Illinois University Carbondale, Carbondale, IL
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 79, Citation Count: 0
|
|
|
ABSTRACT
This paper proposes an approach to safely and tightly bounding data cache performance by computing the worst-case stack distance of data cache accesses. Our approach can not only be applied to direct-mapped caches, but also be used for set-associative or even fully-associative caches without increasing the complexity of analysis. Moreover, the proposed approach can statically categorize worst-case data cache misses into cold, conflict, and capacity misses, which can provide useful insights for designers to enhance the worst-case data cache performance. Our evaluation shows that the proposed data cache timing analysis technique can safely and accurately estimate the worst-case data cache performance, and the overestimation as compared to the observed worst-case data cache misses is within 1% on average.
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
|
K. Beyls and E. D'Hollander. Reuse Distance as a Metric for Cache Behavior. In Proc. of PDCS'01, Aug 2001.
|
 |
2
|
|
| |
3
|
Y. H. Kim, M. D. Hills and D. A. Wood. Implementing stack simulation for highly-associative memories. Technical Report #997, Univ. of Wisconsin, February 1991.
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
C. Berg, J. Engblom and R. Wilhelm. Requirements for an design of a processor with predictable timing. In Proc. of the Dagstuhl Perspectives Workshop on Design of Systems with Predictable Behavior, 2004.
|
| |
11
|
C. Rochange and P. Sainrat: Difficulties in computing the WCET for processors with speculative execution. In Proc. of WCET, 2002.
|
| |
12
|
R. Arnold, F. Muller, D. Whalley, and M. Harmon. Bounding worst-case instruction cache performance. In Proc. of the Real-Time Systems Symposium, 1994.
|
| |
13
|
|
| |
14
|
Yau-Tsun Steven Li , Sharad Malik , Andrew Wolfe, Performance estimation of embedded software with instruction cache modeling, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.380-387, November 05-09, 1995, San Jose, California, United States
|
| |
15
|
|
| |
16
|
S. Lim, et al. An accurate worst case timing analysis technique for RISC processors. In Proc. of the 15th IEEE Real-Time Systems Symposium, 1994.
|
| |
17
|
Trimaran homepage, http://www.trimaran.org.
|
| |
18
|
|
| |
19
|
V. Zivojnovic, J. Martinez and C. Schl. DSPstone: A DSP-oriented benchmarking methodology. In Proc. of ICSPAT'94, Oct. 1994.
|
|