Competitive distributed file allocation.

DOI10.1016/S0890-5401(03)00055-5zbMath1069.68028MaRDI QIDQ1427858

Amos Fiat, Yair Bartal, Baruch Awerbuch

Publication date: 14 March 2004

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

distributed environmentdynamic optimization of communication costs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (6)

On-line generalized Steiner problem ⋮ Non-greedy online Steiner trees on outerplanar graphs ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ Dynamic Balanced Graph Partitioning ⋮ Facility location models to locate data in information networks: a literature review ⋮ Asymptotically optimal online page migration on three points

Cites Work

• Unnamed Item
• Competitive algorithms for distributed data management.
• Competitive snoopy caching
• On the power of randomization in on-line algorithms
• Dynamic Steiner Tree Problem
• Competitive On-Line Algorithms for Distributed Data Management
• Page Migration Algorithms Using Work Functions
• Online tracking of mobile users
• Greedy algorithms for the on-line steiner tree and generalized steiner problems

This page was built for publication: Competitive distributed file allocation.