Calculating stack distances efficiently

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 runtimes of our benchmarks.

Original languageEnglish (US)
Title of host publicationProceedings of the 2002 Workshop on Memory System Performance, MSP 2002
PublisherAssociation for Computing Machinery, Inc
Pages37-43
Number of pages7
ISBN (Electronic)1581134789, 9781581134780
DOIs
StatePublished - Jun 16 2002
Event2002 Workshop on Memory System Performance, MSP 2002 - Berlin, Germany
Duration: Jun 16 2002 → …

Publication series

NameProceedings of the 2002 Workshop on Memory System Performance, MSP 2002

Other

Other2002 Workshop on Memory System Performance, MSP 2002
CountryGermany
CityBerlin
Period6/16/02 → …

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

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

Cite this