Calculating stack distances efficiently
- 16 June 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 38 (2 suppleme), 37-43
- https://doi.org/10.1145/773039.773043
Abstract
This paper1 describes our experience using the stack processing algorithm [6] for estimating the number of cache misses in scientific programs. By using a new data structure and various optimization techniques we obtain instrumented run-times within 50 to 100 times the original optimized run-times of our benchmarks.Keywords
This publication has 7 references indexed in Scilit:
- Set-associative cache simulation using generalized binomial treesACM Transactions on Computer Systems, 1995
- Efficient trace-driven simulation methods for cache performance analysisACM Transactions on Computer Systems, 1991
- Evaluating associativity in CPU cachesIEEE Transactions on Computers, 1989
- The Perfect Club Benchmarks: Effective Performance Evaluation of SupercomputersThe International Journal of Supercomputing Applications, 1989
- Efficient (stack) algorithms for analysis of write-back and sector memoriesACM Transactions on Computer Systems, 1989
- LRU Stack ProcessingIBM Journal of Research and Development, 1975
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970