Competitive algorithms for distributed data management.
From MaRDI portal
Publication:960500
DOI10.1006/JCSS.1995.1073zbMath1294.68071OpenAlexW1972442117MaRDI QIDQ960500
Yuval Rabani, Amos Fiat, Yair Bartal
Publication date: 21 December 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a1eaec29dc4cd2f97b22fc8c57f8f292cc81b085
Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (25)
New results for online page replication ⋮ On-line generalized Steiner problem ⋮ Low-diameter graph decomposition is in NC ⋮ New on-line algorithms for the page replication problem ⋮ Page migration with limited local memory capacity ⋮ Non-greedy online Steiner trees on outerplanar graphs ⋮ Terminal embeddings ⋮ Budget constrained minimum cost connected medians ⋮ Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ A \(3 + \Omega (1)\) lower bound for page migration ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ Distributed transactional memory for metric-space networks ⋮ Dynamic Balanced Graph Partitioning ⋮ Competitive distributed file allocation. ⋮ Uniform page migration problem in Euclidean space ⋮ An algorithm for dynamic data allocation in distributed systems ⋮ On the competitive ratio for online facility location ⋮ On page migration and other relaxed task systems ⋮ Online algorithms for page replication in rings ⋮ Equilibria in Online Games ⋮ A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts ⋮ Optimal algorithms for page migration in dynamic networks ⋮ Asymptotically optimal online page migration on three points
This page was built for publication: Competitive algorithms for distributed data management.
