Asymptotically optimal online page migration on three points

DOI10.1007/s00453-013-9841-9zbMath1325.68260OpenAlexW1984337240MaRDI QIDQ2350908

Akira Matsubayashi

Publication date: 25 June 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://kanazawa-u.repo.nii.ac.jp/?action=repository_action_common_download&item_id=8546&item_no=1&attribute_id=26&file_no=1

zbMATH Keywords

competitive analysispage migrationwork function algorithmserver problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11) Online algorithms; streaming algorithms (68W27)

Related Items (2)

A \(3 + \Omega (1)\) lower bound for page migration ⋮ Uniform page migration problem in Euclidean space

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive algorithms for distributed data management.
• Optimal algorithms for page migration in dynamic networks
• Competitive snoopy caching
• Competitive distributed file allocation.
• The 3-server problem in the plane.
• Distributed Paging for General Networks
• Competitive On-Line Algorithms for Distributed Data Management
• Page Migration Algorithms Using Work Functions
• On the k -server conjecture
• On page migration and other relaxed task systems

This page was built for publication: Asymptotically optimal online page migration on three points