Competitive algorithms for distributed data management

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

82 Scopus citations

Abstract

We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([C], [DF], [ML]), where copies of a file may be be stored in the local storage of some subset of processors, copies may be replicated and discarded over time so as to optimize communication costs, but multiple copies must be kept consistent and at least one copy must be stored somewhere in the network at all times. We deal with competitive algorithms for minimizing communication costs, over arbitrary sequences of reads and writes, and arbitrary network topologies. We define the constrained file allocation problem to be the solution of many individual file allocation problems simultaneously, subject to the constraints of local memory size. We give competitive algorithms for this problem on uniform networks. We then introduce distributed competitive algorithms for on-line data tracking (a generalization of mobile user tracking [API, AP3]) to transform our competitive distributed data management algorithms into distributed algorithms themselves.

Original languageAmerican English
Title of host publicationProceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
PublisherAssociation for Computing Machinery
Pages39-50
Number of pages12
ISBN (Electronic)0897915119
DOIs
StatePublished - 1 Jul 1992
Externally publishedYes
Event24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada
Duration: 4 May 19926 May 1992

Publication series

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

Conference

Conference24th Annual ACM Symposium on Theory of Computing, STOC 1992
Country/TerritoryCanada
CityVictoria
Period4/05/926/05/92

Bibliographical note

Publisher Copyright:
© 1992 ACM.

Fingerprint

Dive into the research topics of 'Competitive algorithms for distributed data management'. Together they form a unique fingerprint.

Cite this