Competitive algorithms for distributed data management.

DOI10.1006/JCSS.1995.1073zbMATH Open1294.68071OpenAlexW1972442117MaRDI QIDQ960500FDOQ960500

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

Recommendations

• Competitive On-Line Algorithms for Distributed Data Management
• Efficient algorithms for dynamic allocation of distributed memory
• Competitive distributed file allocation.
• Distributed Paging for General Networks
• scientific article; zbMATH DE number 1759986

zbMATH Keywords

competitive algorithmsfile allocation problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15) Distributed algorithms (68W15)

Cited In (29)

• On the competitive ratio for online facility location
• On-line generalized Steiner problem
• Title not available (Why is that?)
• Competitive distributed file allocation.
• Uniform page migration problem in Euclidean space
• Title not available (Why is that?)
• Low-diameter graph decomposition is in NC
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• Non-greedy Online Steiner Trees on Outerplanar Graphs
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
• Budget constrained minimum cost connected medians
• Dynamic Balanced Graph Partitioning
• Terminal embeddings
• Non-greedy online Steiner trees on outerplanar graphs
• Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
• Distributed transactional memory for metric-space networks
• Optimal aggregation algorithms for middleware.
• Online algorithms for page replication in rings
• Optimal algorithms for page migration in dynamic networks
• New on-line algorithms for the page replication problem
• Page migration with limited local memory capacity
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
• Equilibria in online games
• New results for online page replication
• On page migration and other relaxed task systems
• Approximation algorithms for data management in networks
• An algorithm for dynamic data allocation in distributed systems

This page was built for publication: Competitive algorithms for distributed data management.

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