Uniform page migration problem in Euclidean space
From MaRDI portal
Publication:1736826
DOI10.3390/A9030057zbMath1453.68219OpenAlexW2515062306MaRDI QIDQ1736826
Akira Matsubayashi, Amanj Khorramian
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a9030057
Euclidean spacecompetitive analysisonline algorithmsuniform modeladversary modelserver problemspage migration problem
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Competitive algorithms for distributed data management.
- A \(3 + \Omega (1)\) lower bound for page migration
- Asymptotically optimal online page migration on three points
- Competitive On-Line Algorithms for Distributed Data Management
- Page Migration Algorithms Using Work Functions
- On page migration and other relaxed task systems
This page was built for publication: Uniform page migration problem in Euclidean space