Optimal algorithms for page migration in dynamic networks

DOI10.1016/j.jda.2008.07.006zbMath1192.68921OpenAlexW2103253701MaRDI QIDQ1044046

Jaroslaw Byrka, Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.07.006

zbMATH Keywords

online algorithmsrandomized algorithmsdynamic networkspage migrationdata management

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (1)

Asymptotically optimal online page migration on three points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better lower bound on the competitive ratio of the randomized 2-server problem
• Competitive algorithms for distributed data management.
• New results for online page replication
• New On-Line Algorithms for the Page Replication Problem
• Distributed Paging for General Networks
• Competitive On-Line Algorithms for Distributed Data Management
• Page Migration Algorithms Using Work Functions
• Competitive distributed file allocation
• Algorithms – ESA 2005
• Mathematical Foundations of Computer Science 2005
• STACS 2005
• On page migration and other relaxed task systems
• Online algorithms for page replication in rings

This page was built for publication: Optimal algorithms for page migration in dynamic networks