Algorithms for non-uniform size data placement on parallel disks
From MaRDI portal
Publication:5491456
DOI10.1016/j.jalgor.2004.06.007zbMath1112.68138OpenAlexW2063730794MaRDI QIDQ5491456
Samir Khuller, Srinivas Kashyap
Publication date: 5 October 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.06.007
Related Items
Approximation schemes for generalized two-dimensional vector packing with application to data placement ⋮ Improved approximation algorithms for data migration ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Algorithms for storage allocation based on client preferences ⋮ A note on dual approximation algorithms for class constrained bin packing problems ⋮ Locality-preserving allocations problems and coloured bin packing