Results 1 
4 of
4
Competitive Paging With Locality of Reference
 Journal of Computer and System Sciences
, 1991
"... Abstract The SleatorTarjan competitive analysis of paging [Comm. of the ACM; 28:202 208, 1985] gives us the ability to make strong theoretical statements about the performance of paging algorithms without making probabilistic assumptions on the input. Nevertheless practitioners voice reservations ..."
Abstract

Cited by 121 (3 self)
 Add to MetaCart
Abstract The SleatorTarjan competitive analysis of paging [Comm. of the ACM; 28:202 208, 1985] gives us the ability to make strong theoretical statements about the performance of paging algorithms without making probabilistic assumptions on the input. Nevertheless practitioners voice reservations about the model, citing its inability to discern between LRU and FIFO (algorithms whose performances differ markedly in practice), and the fact that the theoretical competitiveness of LRU is much larger than observed in practice. In addition, we would like to address the following important question: given some knowledge of a program's reference pattern, can we use it to improve paging performance on that program?
MARKOV PAGING
, 2000
"... This paper considers the problemof paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the faultrate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithmthat achieve ..."
Abstract

Cited by 61 (4 self)
 Add to MetaCart
This paper considers the problemof paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the faultrate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithmthat achieves optimal faultrate on any Markov chain. Next, we address the problemof devising a paging strategy with low faultrate for a given Markov chain. We show that a number of intuitive approaches fail. Our main result is a polynomialtime procedure that, on any Markov chain, will give a paging algorithm with faultrate at most a constant times optimal. Our techniques show also that some algorithms that do poorly in practice fail in the Markov setting, despite known (good) performance guarantees when the requests are generated independently from a probability distribution.
Online Algorithms: Competitive Analysis and Beyond
 in Algorithms and Theory of Computation
, 1999
"... this article, but rather a deep principle of online analysis known as Yao's minimax theorem [Yao, 1980]. This theorem is actually an adaptation of the famous minimax theorem of game theory [von Neumann and Morgenstern, 1947]. It states that the best ratio achievable by a deterministic algorithm aga ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this article, but rather a deep principle of online analysis known as Yao's minimax theorem [Yao, 1980]. This theorem is actually an adaptation of the famous minimax theorem of game theory [von Neumann and Morgenstern, 1947]. It states that the best ratio achievable by a deterministic algorithm against any distribution is exactly the same as the best ratio achievable by a randomized algorithm against a worstcase adversary. More formally, for a given online problem let F n denote the family of input instances of size at most n. Let D n denote the set of all probability distributions over the instances in F n . Let A n
Paging Against a Distribution and IP Networking
 International Country Risk Guide – ICRG
, 1999
"... In this paper we consider the paging problem when the page request sequence is drawn from a distribution, and give an application to computer networking. In the IPpaging problem the page interrequest times are chosen according to independent distributions. For this model we construct a very simple ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we consider the paging problem when the page request sequence is drawn from a distribution, and give an application to computer networking. In the IPpaging problem the page interrequest times are chosen according to independent distributions. For this model we construct a very simple deterministic algorithm whose page fault rate is at most 5 times that of the best online algorithm (that knows the interrequest time distributions). We also show that many other natural algorithms for this problem do not have constant competitive ratio. In distributional paging the interrequest time distributions may be dependent, and hence any probabilistic model of page request sequences can be represented. We construct a simple randomized algorithm whose page fault rate is at most 4 times that of the best online algorithm. The IPpaging problem is motivation by the following application to data networks. Next generation wide area networks are very likely to use connectionoriented prot...