Distributed paging for general networks

Baruch Awerbuch, Yair Bartal, Amos Fiat

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

Abstract

Distributed paging [BFR92, ABF93b, AK95] deals with the dynamic allocation of copies of files in a distributed network as to minimize the total communication cost over a sequence of read and write requests. Most previous work deals with the file allocation problem [BS89, West91, CLRVV93, ABF93a, WY93, Koga93, AK94, LRWY94] where infinite nodal memory capacity is assumed. In contrast the distributed paging problem makes the more realistic assumption that nodal memory capacity is limited. Former work on distributed paging deals with the problem only in the case of a uniform network topology. This paper gives the first distributed paging algorithm for general networks. The algorithm is competitive in storage and communication. The competitive ratios are poly-logarithmic in the total number of network nod es and the diameter of the network.

Original languageEnglish
Title of host publicationProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
PublisherAssociation for Computing Machinery
Pages574-583
Number of pages10
ISBN (Electronic)0898713668
StatePublished - 28 Jan 1996
Event7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States
Duration: 28 Jan 199630 Jan 1996

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
VolumePart F129447

Conference

Conference7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
Country/TerritoryUnited States
CityAtlanta
Period28/01/9630/01/96

Fingerprint

Dive into the research topics of 'Distributed paging for general networks'. Together they form a unique fingerprint.

Cite this