Abstract
This paper 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 runtimes of our benchmarks.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 37-43 |
| Number of pages | 7 |
| Journal | ACM SIGPLAN Notices |
| Volume | 38 |
| Issue number | 2 SUPPL. |
| DOIs | |
| State | Published - Feb 2003 |
Keywords
- Cache modeling
- Measurement and monitoring
- Memory systems
- Simulation
ASJC Scopus subject areas
- Software
- Computer Graphics and Computer-Aided Design
Fingerprint
Dive into the research topics of 'Calculating stack distances efficiently'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS