Competitive algorithms for distributed data management

Yair Bartal, Amos Fiat, Yuval Rabani

Research output: Contribution to journalArticlepeer-review

Abstract

We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem, where copies of a file may be be stored in the local storage of some subsets 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 the uniform network topology. We then introduce distributed competitive algorithms for on-line data tracking (a generalization of mobile user tracking) to transform our competitive data management algorithms into distributed algorithms themselves.

Original languageEnglish
Pages (from-to)341-358
Number of pages18
JournalJournal of Computer and System Sciences
Volume51
Issue number3
DOIs
StatePublished - Dec 1995

Fingerprint

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

Cite this