83 search results - page 3 / 17 » Cache Replacement with Dynamic Exclusion |
112
click to vote
IPL
2007
15 years 4 months ago
2007
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
181
click to vote
ISCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Performance loss due to long-latency memory accesses can be reduced by servicing multiple memory accesses concurrently. The notion of generating and servicing long-latency cache m...
157
click to vote
ACMSE
2004
ACM
15 years 10 months ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
157
click to vote
ICDCS
2003
IEEE
15 years 10 months ago
2003
IEEE
Dynamic module replacement — the ability to hot swap a component’s implementation at runtime — is fundamental to supporting evolutionary change in long-lived and highlyavail...
135
click to vote
ISCA
2010
IEEE
15 years 3 months ago
2010
IEEE
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy alwa...