Calculating Stack Distances Efficiently (2001)
by
George Almasi
,
George Alm Asi
,
Calin Cascaval
,
David A. Padua
| Citations: | 29 - 1 self |
BibTeX
@MISC{Almasi01calculatingstack,
author = {George Almasi and George Alm Asi and Calin Cascaval and David A. Padua},
title = {Calculating Stack Distances Efficiently},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 7320 | Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985 |
| 605 | The art of computer programming, volume 3: Sorting and searching - Knuth - 1973 |
| 251 | Evaluating associativity in CPU caches - Hill, Smith - 1989 |
| 31 | Lru stack processing - Bennet, Kruskal - 1975 |
| 16 | Set-associative cache simulation using generalized binomial trees - Sugumar, Abraham - 1995 |
| 16 | Efficient (stack) algorithms for analysis of write-back and sector memories - THOMPSON, J - 1989 |
| 10 | One-pass techniques for the evaluation of memory hierarchies - Traiger, Slutz - 1971 |
