Revisiting randomized parallel load balancing algorithms
From MaRDI portal
Publication:442270
DOI10.1016/j.tcs.2012.01.009zbMath1252.68345OpenAlexW2179911242MaRDI QIDQ442270
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.009
Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Discrete location and assignment (90B80) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocating weighted jobs in parallel
- Parallel Randomized Load Balancing: A Lower Bound for a More General Model
- How asymmetry helps load balancing
- Balanced Allocations
- Parallel randomized load balancing
- Contention Resolution in Hashing Based Shared Memory Simulations
- Probability and Computing
This page was built for publication: Revisiting randomized parallel load balancing algorithms