A 3 + (1) lower bound for page migration

DOI10.1007/S00453-020-00696-5zbMATH Open1453.68220OpenAlexW3013987113MaRDI QIDQ2196608FDOQ2196608

Authors: 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

Recommendations

• Asymptotically optimal online page migration on three points
• Asymptotically optimal online page migration on three points
• Page Migration Algorithms Using Work Functions
• Optimal algorithms for page migration in dynamic networks
• STACS 2005

zbMATH Keywords

competitive analysisonline algorithmserver problempage migrationwork function

Mathematics Subject Classification ID

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

Cites Work

• Competitive On-Line Algorithms for Distributed Data Management
• Competitive algorithms for distributed data management.
• Page Migration Algorithms Using Work Functions
• On page migration and other relaxed task systems
• Asymptotically optimal online page migration on three points
• Title not available (Why is that?)
• Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

Cited In (7)

• Uniform page migration problem in Euclidean space
• Online Distributed Object Migration
• STACS 2005
• Page Migration Algorithms Using Work Functions
• Optimal algorithms for page migration in dynamic networks
• Page migration with limited local memory capacity
• On page migration and other relaxed task systems

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

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