Competitive On-Line Algorithms for Distributed Data Management

DOI10.1137/S0097539795287824zbMath0933.68152OpenAlexW2030810980MaRDI QIDQ4229425

Nick Reingold, Dicky C. K. Yan, Carstent Lund, Jeffery Westbrook

Publication date: 22 February 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539795287824

zbMATH Keywords

competitive analysismemory managementon-line algorithmsdata management

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (18)

New results for online page replication ⋮ On-line generalized Steiner problem ⋮ New on-line algorithms for the page replication problem ⋮ Page migration with limited local memory capacity ⋮ Non-greedy online Steiner trees on outerplanar graphs ⋮ A \(3 + \Omega (1)\) lower bound for page migration ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ Competitive distributed file allocation. ⋮ New bounds for the controller problem ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Uniform page migration problem in Euclidean space ⋮ On the competitive ratio for online facility location ⋮ On page migration and other relaxed task systems ⋮ Online algorithms for page replication in rings ⋮ On the Bahncard problem ⋮ Competitive analysis of randomized paging algorithms ⋮ Optimal algorithms for page migration in dynamic networks ⋮ Asymptotically optimal online page migration on three points

This page was built for publication: Competitive On-Line Algorithms for Distributed Data Management