Page Migration Algorithms Using Work Functions

DOI10.1006/jagm.1996.0853zbMath0882.68068OpenAlexW2075784392MaRDI QIDQ4349701

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

Publication date: 25 August 1997

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

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)

Related Items

New results for online page replication, New on-line algorithms for the page replication problem, A \(3 + \Omega (1)\) lower bound for page migration, Competitive distributed file allocation., Uniform page migration problem in Euclidean space, Cost thresholds for dynamic resource location, On page migration and other relaxed task systems, Competitive analysis of randomized paging algorithms, Optimal algorithms for page migration in dynamic networks, The 3-server problem in the plane., Randomized competitive algorithms for the list update problem, Asymptotically optimal online page migration on three points