STACS 2005

DOI10.1007/B106485zbMATH Open1118.68358OpenAlexW4230940848MaRDI QIDQ5710690FDOQ5710690

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

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

Mathematics Subject Classification ID

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

Cited In (15)

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

This page was built for publication: STACS 2005

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