Results 1  10
of
893,143
The LRUK Page Replacement Algorithm For Database Disk Buffering
, 1993
"... This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival time of such references on a page by ..."
Abstract

Cited by 327 (3 self)
 Add to MetaCart
by page basis. Although the LRUK approach performs optimal statistical inference under relatively standard assumptions, it is fairly simple and incurs little bookkeeping overhead. As we demonstrate with simulation experiments, the LRUK algorithm surpasses conventional buffering algorithms
The Product Replacement Algorithm is Polynomial
 In Proc. 41 st IEEE Symposium on Foundations of Computer Science (FOCS
, 2000
"... The product replacement algorithm is a heuristic designed to generate random group elements. The idea is to run a random walk on generating ktuples of the group, and then output a random component. The algorithm was designed by LeedhamGreen and Soicher ([31]), and further investigated in [12]. It ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
The product replacement algorithm is a heuristic designed to generate random group elements. The idea is to run a random walk on generating ktuples of the group, and then output a random component. The algorithm was designed by LeedhamGreen and Soicher ([31]), and further investigated in [12
The EELRU adaptive replacement algorithm �
, 2002
"... The wide performance gap between processors and disks ensures that effective page replacement remains an important consideration in modern systems. This paper presents early eviction LRU (EELRU), an adaptive replacement algorithm. EELRU uses aggregate recency information to recognize the reference b ..."
Abstract
 Add to MetaCart
The wide performance gap between processors and disks ensures that effective page replacement remains an important consideration in modern systems. This paper presents early eviction LRU (EELRU), an adaptive replacement algorithm. EELRU uses aggregate recency information to recognize the reference
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 544 (6 self)
 Add to MetaCart
parameterized fashion for high performance. Tracedriven simulations show that with the appropriate cost definition, GreedyDualSize outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDualSize can potentially
Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
"... In a pathbreaking paper last year Pat and Betty O'Neil and Gerhard Weikum proposed a selftuning improvement to the Least Recently Used (LRU) buffer management algorithm[15]. Their improvement is called LRU/k and advocates giving priority to buffer pages based on the kth most recent access. (T ..."
Abstract

Cited by 234 (2 self)
 Add to MetaCart
. (The standard LRU algorithm is denoted LRU/1 according to this terminology.) If P1's kth most recent access is more more recent than P2's, then P1 will be replaced after P2. Intuitively, LRU/k for k ? 1 is a good strategy, because it gives low priority to pages that have been scanned
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Approximating the Optimal Replacement Algorithm
, 2004
"... LRU is the de facto standard page replacement strategy. It is wellknown, however, that there are many situations where LRU behaves far from optimal. We present a replacement policy that approximates the optimal algorithm OPT more closely by predicting the time each page will be referenced again and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
LRU is the de facto standard page replacement strategy. It is wellknown, however, that there are many situations where LRU behaves far from optimal. We present a replacement policy that approximates the optimal algorithm OPT more closely by predicting the time each page will be referenced again
Counterbased cache replacement algorithms
 In Proceedings of ICCD 2005
, 2005
"... 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, suggesting that alternative replacement algorithms can improve the performance of the cache. One main reason for this pe ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
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, suggesting that alternative replacement algorithms can improve the performance of the cache. One main reason
Results 1  10
of
893,143