Competitive Algorithms for Distributed Data Management

DMCA

Competitive Algorithms for Distributed Data Management (0)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yair Bartal , Amos Fiat , Yuval Rabani

Venue:	In Proceedings of the 24th Annual ACM Symposium on Theory of Computing
Citations:	101 - 8 self

BibTeX

@INPROCEEDINGS{Bartal_competitivealgorithms,
    author = {Yair Bartal and Amos Fiat and Yuval Rabani},
    title = {Competitive Algorithms for Distributed Data Management},
    booktitle = {In Proceedings of the 24th Annual ACM Symposium on Theory of Computing},
    year = {},
    pages = {39--50}
}

OpenURL

Abstract

We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([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 the uniform network topology. We then introduce distributed competitive algorithms for on-line data tracking (a generalization of mobile user tracking [AP1...

Keyphrases

competitive algorithm distributed data management file allocation problem communication cost many individual file allocation problem mobile user local memory size on-line data tracking competitive analysis arbitrary network topology local storage multiple copy arbitrary sequence uniform network topology distributed environment

DMCA