On Paging with Locality of Reference

Susanne Albers, Lene Monrad Favrholdt, Oliver Giel

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review


Motivated by the fact that competitive analysis yields too pessimistic results when applied to the paging problem, there has been considerable research 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 practice. This is the first such study for an alternative/refined paging model.
TitelACM Symposium on Theory of Computing
Antal sider10
StatusUdgivet - 2002
BegivenhedACM Symposium on Theory of Computing - Montreal, Canada
Varighed: 24. aug. 2010 → …
Konferencens nummer: 34


KonferenceACM Symposium on Theory of Computing
Periode24/08/2010 → …


Dyk ned i forskningsemnerne om 'On Paging with Locality of Reference'. Sammen danner de et unikt fingeraftryk.