A \(3 + \Omega (1)\) lower bound for page migration

DOI10.1007/s00453-020-00696-5zbMath1453.68220OpenAlexW3013987113MaRDI QIDQ2196608

Akira Matsubayashi

Publication date: 3 September 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00696-5

zbMATH Keywords

competitive analysisonline algorithmpage migrationserver problemwork function

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Uniform page migration problem in Euclidean space

Cites Work

• Competitive algorithms for distributed data management.
• Asymptotically optimal online page migration on three points
• Competitive On-Line Algorithms for Distributed Data Management
• Page Migration Algorithms Using Work Functions
• Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
• On page migration and other relaxed task systems
• Unnamed Item

This page was built for publication: A \(3 + \Omega (1)\) lower bound for page migration