Maximizing data locality in distributed systems
From MaRDI portal
Recommendations
Cites work
- Approximation algorithms for extensible bin packing
- Approximation algorithms for NP-hard problems.
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1343489 (Why is no real title available?)
- scientific article; zbMATH DE number 2080852 (Why is no real title available?)
- On the online bin packing problem
Cited in
(8)- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
- The data locality of work stealing
- Self-stabilizing local k-placement of replicas with local minimum variance
- Locality-preserving allocations problems and coloured bin packing
- Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments
- Improved replica placement strategy for data in heterogeneous Hadoop cluster
- A hierarchical model of data locality
- scientific article; zbMATH DE number 2243626 (Why is no real title available?)
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)