Competitive Algorithms for Distributed Data Management

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 51; číslo 3; s. 341 - 358
Hlavní autoři: Bartal, Y., Fiat, A., Rabani, Y.
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Brugge Elsevier Inc 01.12.1995
Academic Press
Témata:
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Cost minimization
On line
Storage
Allocation
Manipulation
Distributed algorithm
File management
Data transmission
Replication
Resource management
Algorithm analysis
Communication
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0022-0000
1090-2724
DOI:10.1006/jcss.1995.1073