Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Theoretical Computer Science 234 (2000) 203218 www.elsevier.com/locate/tcs
 

Summary: Theoretical Computer Science 234 (2000) 203­218
www.elsevier.com/locate/tcs
Competitive analysis of randomized paging algorithms
Dimitris Achlioptas a;1
, Marek Chrobak b;2
, John Noga c;;2
a Department of Computer Science, University of Toronto, Toronto, Ont., Canada M5S 3G4
b Department of Computer Science, University of California, Riverside, CA 92521, USA
c Department of Mathematics, University of California, Riverside, CA 92521, USA
Received February 1996; revised January 1998
Communicated by F. Yao
Abstract
The paging problem is de˙ned as follows: we are given a two-level memory system, in which
one level is a fast memory, called cache, capable of holding k items, and the second level
is an unbounded but slow memory. At each given time step, a request to an item is issued.
Given a request to an item p, a miss occurs if p is not present in the fast memory. In response
to a miss, we need to choose an item q in the cache and replace it by p. The choice of q
needs to be made on-line, without the knowledge of future requests. The objective is to design
a replacement strategy with a small number of misses. In this paper we use competitive analysis
to study the performance of randomized on-line paging algorithms. Our goal is to show how the

  

Source: Achlioptas, Dimitris - Department of Computer Engineering, University of California at Santa Cruz

 

Collections: Computer Technologies and Information Sciences