Calculating stack distances efficiently

George Almási, Cǎlin Caşcaval, David A Padua

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)37-43
Number of pages7
JournalACM SIGPLAN Notices
Issue number2 SUPPL.
StatePublished - Feb 1 2003


  • Cache modeling
  • Measurement and monitoring
  • Memory systems
  • Simulation

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Calculating stack distances efficiently'. Together they form a unique fingerprint.

Cite this