ACM Home Page
Please provide us with feedback. Feedback
Efficient trace-driven simulation method for cache performance analysis
Full text PdfPdf (1.02 MB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems table of contents
Univ. of Colorado, Boulder, Colorado, United States
Pages: 27 - 36  
Year of Publication: 1990
ISBN:0-89791-359-0
Also published in ...
Authors
Wen-Hann Wang  IBM T.J. Watson Research, P.O. Box 704, Yorktown Heights, NY
Jean-Loup Baer  Dept. of Computer Science and Engineering, University of Washington, Seattle, WA
Sponsor
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 17,   Citation Count: 16
Additional Information:

abstract   references   cited by   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/98457.98497
What is a DOI?

ABSTRACT

We propose improvements to current trace-driven cache simulation methods to make them faster and more economical. We attack the large time and space demands of cache simulation in two ways. First, we reduce the program traces to the extent that exact performance can still be obtained from the reduced traces. Second, we devise an algorithm that can produce performance results for a variety of metrics (hit ratio, write-back counts, bus traffic) for a large number of set-associative write-back caches in just a single simulation run. The trace reduction and the efficient simulation techniques are extended to parallel multiprocessor cache simulations. Our simulation results show that our approach substantially reduces the disk space needed to store the program traces and can dramatically speedup cache simulations and still produce the exact results.


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
AGARWAL, ANANT. Analysis of Cache Per}ormance Dissertation, Stanford University, 1987.
 
2
 
3
 
4
5
 
6
 
7
LIN YI-BING, J.-L. BAER AND E. D. LAZOWSKA. Tailoring a parallel trace-driven simulation technique to specific multiprocessor cache coherence protocols. Tech. Rep. TR 88-03-02, University of Washirtgton, Mar. 1988.
 
8
~IATTSON,R., GECSEI,J., SLUTZ,D. AND I.TRAIGER. Evaluation techniques for storage hierarchies. IBM Systems Journal 9, 2 (1970), 78-117.
 
9
PUZAK, THO.~IAS R. Cache-Memory Design. Ph.D. Dissertation, University of Massachusetts, 1985.
10
11
 
12
SMITrl, A. J. Two methods for the efficient analysis of memory address trace data. IEEE Transaction on Software Engineering 3, 1 (Jan. 1977), 94-101.
13
14
 
15
 
16
TP.AIGER, I.L. AND D.R. SLUTZ. One-pass technique for the evaluation of memory hierarchies. Tech. Rep. RJ 892: IBSI Research, July 1971.
 
17

CITED BY  16

Collaborative Colleagues:
Wen-Hann Wang: colleagues
Jean-Loup Baer: colleagues