A New Locality Metric and Case Studies for HPCS Benchmarks

Yu, Jing; Baghsorkhi, Sara; Snir, Marc

Permalink

https://hdl.handle.net/2142/11017 Copy

Description

Title

A New Locality Metric and Case Studies for HPCS Benchmarks

Author(s)

• Yu, Jing
• Baghsorkhi, Sara
• Snir, Marc

Issue Date

2005-04

Keyword(s)

High-performance computing

Abstract

We propose in this paper a new approach to study the temporal and spatial locality of codes using a plot of cache miss bandwidth as a function of cache size and line size for a fully associative LRU cache. We apply this new approach to the study of locality for several High-Performance benchmarks. We show that this plot capture fine behavior of these benchmarks and explain some of the difficulties that recent attempts to characterize locality using a few parameters are facing: Codes can exhibit different levels of temporal or spatial locality for different cache sizes; averaging these different behavior requires to weight properly the cost of misses at different levels of the memory hierarchy. We propose such a scheme, for an average measure of temporal locality.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11017

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections