Sciweavers

13 search results - page 1 / 3
» The LCD interconnection of LRU caches and its analysis
Sort
View
PE
2006
Springer
103views Optimization» more  PE 2006»
13 years 4 months ago
The LCD interconnection of LRU caches and its analysis
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 -...
Nikolaos Laoutaris, Hao Che, Ioannis Stavrakakis
ACTA
2010
91views more  ACTA 2010»
13 years 5 hour ago
A theoretical comparison of LRU and LRU-K
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S...
INFOCOM
2003
IEEE
13 years 10 months ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
IEEEPACT
2002
IEEE
13 years 10 months ago
Using the Compiler to Improve Cache Replacement Decisions
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosen...
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