Competitive algorithms for distributed data management (extended abstract)

  • Authors:

  • Yair Bartal;Amos Fiat;Yuval Rabani

  • Affiliations:

  • Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel;Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel;Department of Computer Science, School of Mathematics, Tel-Aviv University, Tel-Aviv 69978, Israel

  • Venue:
  • STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

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 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 prblem on uniform networks. We then introduce distributed competitive algorithms for on-line data tracking (a generalization of mobile user tracking [AP1, AP3] to transform our competitive distributed data management algorithms into distributed algorithms themselves.