Strongly competitive algorithms for paging with locality of reference

What is the best paging algorithm if one has partial information about the possible sequences of page requests? We give a partial answer to this question by presenting the analysis of strongly competitive paging algorithms in the access graph model. This model restricts page requests so that they co...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 25; no. 3; pp. 477 - 497
Main Authors IRANI, S, KARLIN, A. R, PHILLIPS, S
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 01.06.1996
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Competition
Computer science
Computer science; control theory; systems
Decomposition
Exact sciences and technology
Graphs
Theoretical computing
Program graph
Algorithms
Optimal algorithm
On line processing
Paging systems
Algorithm analysis
Directed graph
Online AccessGet full text

Cover

More Information
Summary:What is the best paging algorithm if one has partial information about the possible sequences of page requests? We give a partial answer to this question by presenting the analysis of strongly competitive paging algorithms in the access graph model. This model restricts page requests so that they conform to a notion of locality of reference given by an arbitrary access graph We first consider optimal algorithms for undirected access graphs. Borodin et al. [Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 249-259] define an algorithm, called FAR, and prove that it is within a logarithmic factor of the optimal online algorithm. We prove that FAR is in fact strongly competitive, i.e, within a constant factor of the optimum. For directed access graphs, we present an algorithm that is strongly competitive on structured program graphs--graphs that model a subset of the request sequences of structured programs.
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539792236353