Page Migration Algorithms Using Work Functions

DOI10.1006/JAGM.1996.0853MaRDI QIDQ4349701zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, Nick Reingold, Marek Chrobak, Jeffery R. Westbrook

Publication date 25 August 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/4f90764fb8e7d4b1c18696f034804a2aa6487f44

zbMATH Keywords

hypercubeglobally addressed shared memory

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• The work function algorithm for the paging problem
• scientific article; zbMATH DE number 65703
• Optimal algorithms for page migration in dynamic networks
• STACS 2005
• scientific article; zbMATH DE number 5257110
• Mathematical Foundations of Computer Science 2005
• A \(3 + \Omega (1)\) lower bound for page migration

Cited in

(21)

• Competitive distributed file allocation.
• Uniform page migration problem in Euclidean space
• Online Distributed Object Migration
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• Randomized competitive algorithms for the list update problem
• Scheduler-activated dynamic page migration for multiprogrammed DSM multiprocessors
• Competitive analysis of randomized paging algorithms
• Mathematical Foundations of Computer Science 2005
• STACS 2005
• Online algorithms for page replication in rings
• Asymptotically optimal online page migration on three points
• The 3-server problem in the plane.
• Optimal algorithms for page migration in dynamic networks
• scientific article; zbMATH DE number 65703 (Why is no real title available?)
• New on-line algorithms for the page replication problem
• Page migration with limited local memory capacity
• scientific article; zbMATH DE number 5257110 (Why is no real title available?)
• New results for online page replication
• On page migration and other relaxed task systems
• Cost thresholds for dynamic resource location

This page was built for publication: Page Migration Algorithms Using Work Functions

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