Competitive On-Line Algorithms for Distributed Data Management

DOI10.1137/S0097539795287824MaRDI QIDQ4229425zbMATH OpenOpenAlexFDO

Authors Nick Reingold, C. Lund, Jeffery R. Westbrook, Dicky C. K. Yan

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 analysisdata managementmemory managementon-line algorithms

Mathematics Subject Classification ID

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

Recommendations

• Competitive algorithms for distributed data management.
• scientific article; zbMATH DE number 2044915
• Competitive distributed file allocation.
• New on-line algorithms for the page replication problem
• scientific article; zbMATH DE number 1445331

Cited in

(25)

• Optimal algorithms for page migration in dynamic networks
• Online algorithms. The state of the art
• Competitive distributed file allocation.
• Competitive analysis of randomized paging algorithms
• Optimal online algorithms for an electronic commerce money distribution system
• Uniform page migration problem in Euclidean space
• New results for online page replication
• On-line generalized Steiner problem
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• On the competitive ratio for online facility location
• Non-greedy online Steiner trees on outerplanar graphs
• scientific article; zbMATH DE number 1629848 (Why is no real title available?)
• Non-greedy online Steiner trees on outerplanar graphs
• scientific article; zbMATH DE number 1305445 (Why is no real title available?)
• scientific article; zbMATH DE number 2044915 (Why is no real title available?)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
• New on-line algorithms for the page replication problem
• Page migration with limited local memory capacity
• Online Distributed Object Migration
• On page migration and other relaxed task systems
• Online algorithms for page replication in rings
• On the Bahncard problem
• New bounds for the controller problem
• Competitive algorithms for distributed data management.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229425)