Calculating stack distances efficiently

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

doi:10.1145/773039.773043

Calculating stack distances efficiently

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

Siebel School of Computing and Data Science

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1145/773039.773043
State	Published - Feb 2003

Keywords

Cache modeling
Measurement and monitoring
Memory systems
Simulation

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design

Online availability

10.1145/773039.773043

Library availability

Discover UIUC Full Text

Cite this

@article{71912eef804d4d408ed7b3b2ba9a1d68,

title = "Calculating stack distances efficiently",

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.",

keywords = "Cache modeling, Measurement and monitoring, Memory systems, Simulation",

author = "George Alm{\'a}si and Cǎlin Ca{\c s}caval and Padua, {David A.}",

year = "2003",

month = feb,

doi = "10.1145/773039.773043",

language = "English (US)",

volume = "38",

pages = "37--43",

journal = "ACM SIGPLAN Notices",

issn = "0362-1340",

publisher = "Association for Computing Machinery",

number = "2 SUPPL.",

}

TY - JOUR

T1 - Calculating stack distances efficiently

AU - Almási, George

AU - Caşcaval, Cǎlin

AU - Padua, David A.

PY - 2003/2

Y1 - 2003/2

N2 - 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.

AB - 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.

KW - Cache modeling

KW - Measurement and monitoring

KW - Memory systems

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=1442338983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1442338983&partnerID=8YFLogxK

U2 - 10.1145/773039.773043

DO - 10.1145/773039.773043

M3 - Article

AN - SCOPUS:1442338983

SN - 0362-1340

VL - 38

SP - 37

EP - 43

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

IS - 2 SUPPL.

ER -

Calculating stack distances efficiently

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this