Maximizing data locality in distributed systems

DOI10.1016/J.JCSS.2006.07.001zbMATH Open1119.68035OpenAlexW2138595852MaRDI QIDQ856409FDOQ856409

Authors: Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker, Fan Chung, Ron 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

Recommendations

• scientific article; zbMATH DE number 2243626
• Self-stabilizing local \(k\)-placement of replicas with local minimum variance
• Probabilistic resource allocation in heterogeneous distributed systems with random failures
• Publication:3494352
• Distributed Resource Allocation in Stream Processing Systems

zbMATH Keywords

approximation algorithmsbin packingdistributed systemscombinatorial algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for NP-hard problems.
• On the online bin packing problem
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Title not available (Why is that?)
• Approximation algorithms for extensible bin packing
• Title not available (Why is that?)
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

Cited In (5)

• Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments
• Locality-preserving allocations problems and coloured bin packing
• GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
• Title not available (Why is that?)
• The data locality of work stealing

This page was built for publication: Maximizing data locality in distributed systems

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