Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Paging with Locality of Reference Susanne Albers Lene M. Favrholdt Oliver Giel
 

Summary: On Paging with Locality of Reference
Susanne Albers£ Lene M. FavrholdtÝ Oliver GielÞ
Abstract
Motivated by the fact that competitive analysis yields too pessimistic re-
sults when applied to the paging problem, there has been considerable re-
search interest in refining competitive analysis and in developing alternative
models for studying online paging. The goal is to devise models in which
theoretical results capture phenomena observed in practice.
In this paper we propose a new, simple model for studying paging with
locality of reference. The model is closely related to Denning's working set
concept and directly reflects the amount of locality that request sequences
exhibit. We demonstrate that our model is reasonable from a practical point
of view.
We use the page fault rate to evaluate the quality of paging algorithms,
which is the performance measure used in practice. We develop tight or
nearly tight bounds on the fault rates achieved by popular paging algorithms
such as LRU, FIFO, deterministic Marking strategies and LFD. It shows that
LRU is an optimal online algorithm, whereas FIFO and Marking strategies
are not optimal in general. We present an experimental study comparing the
page fault rates proven in our analyses to the page fault rates observed in

  

Source: Albers, Susanne - Institut für Informatik, Humboldt-Universität zu Berlin

 

Collections: Computer Technologies and Information Sciences