Revisiting randomized parallel load balancing algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3586221 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Allocating weighted jobs in parallel
- Balanced Allocations
- Contention Resolution in Hashing Based Shared Memory Simulations
- How asymmetry helps load balancing
- Parallel randomized load balancing
- Parallel randomized load balancing: a lower bound for a more general model
- Probability and Computing
Cited in
(14)- Parallel thinning algorithms on multicomputers: Experimental study on load balancing
- PROBABILISTIC ANALYSIS OF LOAD-IMBALANCED PARALLEL APPLICATIONS WITH PARTIALLY ELIMINATED BARRIERS
- Tight bounds for parallel randomized load balancing
- Parallel randomized load balancing: a lower bound for a more general model
- Parallel randomized load balancing: a lower bound for a more general model
- The 1-2-3-toolkit for building your own balls-into-bins algorithm
- scientific article; zbMATH DE number 2217744 (Why is no real title available?)
- Balanced Allocation: Patience Is Not a Virtue
- Improved algorithms to minimize workload balancing criteria on identical parallel machines
- A unified framework for designing EPTAS's for load balancing on parallel machines
- A run-time load balancing strategy for highly parallel systems
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- A load balancing strategy for parallel computation of sparse permanents.
- Revisiting Randomized Parallel Load Balancing Algorithms
This page was built for publication: Revisiting randomized parallel load balancing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442270)