Efficient trace-driven simulation methods for cache performance analysis
Authors:
Open Access
- 1 August 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 9 (3) , 222-241
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.Keywords
This publication has 7 references indexed in Scilit:
- Evaluating associativity in CPU cachesIEEE Transactions on Computers, 1989
- Mache: no-loss trace compaction1989
- Available instruction-level parallelism for superscalar and superpipelined machines1989
- Efficient (stack) algorithms for analysis of write-back and sector memoriesACM Transactions on Computer Systems, 1989
- Multiprocessor cache analysis using ATUMACM SIGARCH Computer Architecture News, 1988
- Accurate low-cost methods for performance evaluation of cache memory systemsIEEE Transactions on Computers, 1988
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970