Improved algorithms for dynamic page migration

DOI10.1007/978-3-540-31856-9_30MaRDI QIDQ5710690zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms (68W40)

Recommendations

• Optimal algorithms for page migration in dynamic networks
• Page Migration Algorithms Using Work Functions
• Page migration with limited local memory capacity
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points

Cited in

(16)

• Optimal algorithms for page migration in dynamic networks
• Online balanced repartitioning
• A \(3 + \Omega (1)\) lower bound for page migration
• Competitive clustering of stochastic communication patterns on a ring
• Asymptotically optimal online page migration on three points
• Asymptotically optimal online page migration on three points
• Improved Algorithms for Data Migration
• Page Migration Algorithms Using Work Functions
• Page migration with limited local memory capacity
• Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
• Dynamic balanced graph partitioning
• Online Distributed Object Migration
• Algorithms – ESA 2005
• Mathematical Foundations of Computer Science 2005
• On page migration and other relaxed task systems
• Scheduler-activated dynamic page migration for multiprogrammed DSM multiprocessors

This page was built for publication: Improved algorithms for dynamic page migration

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