45 search results - page 4 / 9 » A Case for MLP-Aware Cache Replacement |
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
CODES
2009
IEEE
15 years 2 months ago
2009
IEEE
Reconfigurable Processors utilize a reconfigurable fabric (to implement application-specific accelerators) and may perform runtime reconfigurations to exchange the set of deployed...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
105
click to vote
PE
2006
Springer
14 years 9 months ago
2006
Springer
In a multi-level cache such as those used for web caching, a hit at level l leads to the caching of the requested object in all intermediate caches on the reverse path (levels l -...
85
Voted
CODES
2007
IEEE
15 years 3 months ago
2007
IEEE
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...