127 search results - page 1 / 26 » Counter-Based Cache Replacement Algorithms |
TC
2008
14 years 5 months ago
2008
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
ICCD
2005
IEEE
15 years 2 months ago
2005
IEEE
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
OSDI
2004
ACM
15 years 5 months ago
2004
ACM
Program-counter-based (PC-based) prediction techniques have been shown to be highly effective and are widely used in computer architecture design. In this paper, we explore the op...
IPPS
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
VLDB
2002
ACM
14 years 5 months ago
2002
ACM
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...