Competitive distributed file allocation

DOI10.1145/167088.167142zbMath1310.68037OpenAlexW2129764333MaRDI QIDQ5248483

Baruch Awerbuch, Yair Bartal, Amos Fiat

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167142

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (12)

New results for online page replication ⋮ New on-line algorithms for the page replication problem ⋮ Page migration with limited local memory capacity ⋮ Budget constrained minimum cost connected medians ⋮ Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks ⋮ Strategic Online Facility Location ⋮ Distributed transactional memory for metric-space networks ⋮ On the competitive ratio for online facility location ⋮ On page migration and other relaxed task systems ⋮ Online algorithms for page replication in rings ⋮ Optimal algorithms for page migration in dynamic networks ⋮ Delayed information and action in on-line algorithms

This page was built for publication: Competitive distributed file allocation