Improved space bounds for strongly competitive randomized paging algorithms

  • Paging is one of the prominent problems in the field of on-line algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. Bein et al. [4] conjectured that there exist strongly competitive randomized paging algorithms, using o(k) bookmarks, i.e. pages not in cache that the algorithm keeps track of. Also in [4] the first algorithm using O(k) bookmarks (2k more precisely), Equitable2, was introduced, proving in the affirmative a conjecture in [7]. We prove tighter bounds for Equitable2, showing that it requires less than k bookmarks, more precisely ≈ 0.62k. We then give a lower bound for Equitable2 showing that it cannot both be strongly competitive and use o(k) bookmarks. Nonetheless, we show that it can trade competitiveness for space. More precisely, if its competitive ratio is allowed to be (Hk + t), then it requires k/(1 + t) bookmarks. Our main result proves the conjecture that there exist strongly competitive paging algorithms using o(k) bookmarks. We propose an algorithm, denoted Partition2, which is a variant of the Partition algorithm byMcGeoch and Sleator [13]. While classical Partition is unbounded in its space requirements, Partition2 uses θ(k/ log k) bookmarks. Furthermore, we show that this result is asymptotically tight when the forgiveness steps are deterministic.

Download full text files

Export metadata

Metadaten
Author:Gabriel Moruz, Andrei Laurian NegoescuGND
URN:urn:nbn:de:hebis:30:3-296745
ISSN:1868-8330
Parent Title (German):Frankfurter Informatik-Berichte
Publisher:Univ.-Bibliothek
Place of publication:Frankfurt am Main
Document Type:Report
Language:English
Date of Publication (online):2013/04/04
Year of first Publication:2013
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2013/04/04
Tag:Online algorithms; Paging; Randomized algorithms
Page Number:11
HeBIS-PPN:336212968
Institutes:Informatik und Mathematik / Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License LogoDeutsches Urheberrecht