Heat & Dump: Competitive distributed paging

Baruch Awerbuch, Yair Bartal, Amos Fiat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper gives a randomized competitive distributed paging algorithm called Heat & Dump. The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio [BFR].

Original languageEnglish
Title of host publicationAnnual Symposium on Foundatons of Computer Science (Proceedings)
Editors Anon
PublisherPubl by IEEE
Pages22-31
Number of pages10
ISBN (Print)0818643706
StatePublished - 1993
EventProceedings of the 34th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
Duration: 3 Nov 19935 Nov 1993

Publication series

NameAnnual Symposium on Foundatons of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

ConferenceProceedings of the 34th Annual Symposium on Foundations of Computer Science
CityPalo Alto, CA, USA
Period3/11/935/11/93

Fingerprint

Dive into the research topics of 'Heat & Dump: Competitive distributed paging'. Together they form a unique fingerprint.

Cite this