Sciweavers

30 search results - page 1 / 6
» Estimating cache misses and locality using stack distances
Sort
View
ICS
2003
Tsinghua U.
13 years 10 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua
MEMOCODE
2008
IEEE
13 years 11 months ago
Estimating the Performance of Cache Replacement Policies
—Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. The cache performance strongly influences a system’...
Daniel Grund, Jan Reineke
POPL
2007
ACM
14 years 5 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
IPPS
2010
IEEE
13 years 2 months ago
Multicore-aware reuse distance analysis
This paper presents and validates methods to extend reuse distance analysis of application locality characteristics to shared-memory multicore platforms by accounting for invalidat...
Derek L. Schuff, Benjamin S. Parsons, Vijay S. Pai
IWMM
2011
Springer
217views Hardware» more  IWMM 2011»
12 years 7 months ago
On the theory and potential of LRU-MRU collaborative cache management
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can o...
Xiaoming Gu, Chen Ding