Competitive distributed file allocation

Baruch Awerbuch, Yair Bartal, Amos Fiat

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

88 Scopus citations

Abstract

This paper deals with the file allocation problem [BFR92] concerning the dynamic optimization of communication costs to access data in a distributed environment. We develop a dynamic file reallocation strategy that adapts online to a sequence of Tead and write requests whose location and relative frequencies are completely unpredictable. This is achieved by replicating the file in response to read requests and migrating the file in response to write requests while paying the associated communications costs, so as to be closer to processors that access it frequently. We develop first explicit deterministic online strategy assuming existence of global information about the state of the network; previous (deterministic) solutions were non-constructive and more expensive. Our solution has (optimal) logarithmic competitive ratio. The paper also contains the first explicit deterministic data migration [BS89] algorithm achieving the best known competitive ratio for this problem. Using somewhat different technique, we also develop the first deterministic distributed file allocation algorithm (using only local information) with poly-logarithmic competitive ratio against a globally- optimized optimal prescient strategy.

Original languageAmerican English
Title of host publicationProceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
PublisherAssociation for Computing Machinery
Pages164-173
Number of pages10
ISBN (Electronic)0897915917
DOIs
StatePublished - 1 Jun 1993
Externally publishedYes
Event25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States
Duration: 16 May 199318 May 1993

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129585
ISSN (Print)0737-8017

Conference

Conference25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/TerritoryUnited States
CitySan Diego
Period16/05/9318/05/93

Bibliographical note

Publisher Copyright:
© 1993 ACM.

Fingerprint

Dive into the research topics of 'Competitive distributed file allocation'. Together they form a unique fingerprint.

Cite this