A 3 + (1) lower bound for page migration
From MaRDI portal
Publication:2196608
Recommendations
Cites work
- scientific article; zbMATH DE number 5257110 (Why is no real title available?)
- Asymptotically optimal online page migration on three points
- Competitive On-Line Algorithms for Distributed Data Management
- Competitive algorithms for distributed data management.
- Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
- On page migration and other relaxed task systems
- Page Migration Algorithms Using Work Functions
Cited in
(9)- Optimal algorithms for page migration in dynamic networks
- STACS 2005
- On page migration and other relaxed task systems
- Page Migration Algorithms Using Work Functions
- Asymptotically optimal online page migration on three points
- Page migration with limited local memory capacity
- Online Distributed Object Migration
- Asymptotically optimal online page migration on three points
- Uniform page migration problem in Euclidean space
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)