Maximizing data locality in distributed systems

DOI10.1016/j.jcss.2006.07.001zbMath1119.68035OpenAlexW2138595852MaRDI QIDQ856409

Geoffrey M. Voelker, Ranjita Bhagwan, Stefan Savage, Fan R. K. Chung, Ronald L. Graham

Publication date: 7 December 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.07.001

zbMATH Keywords

distributed systemsapproximation algorithmsbin packingcombinatorial algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Approximation algorithms (68W25)

Related Items

Locality-preserving allocations problems and coloured bin packing

Cites Work

• Approximation algorithms for extensible bin packing
• On the online bin packing problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item