Parallel randomized load balancing: a lower bound for a more general model

DOI10.1016/j.tcs.2011.01.033zbMath1218.68207OpenAlexW2066465352MaRDI QIDQ533886

Guy Even, Moti Medina

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.033

zbMATH Keywords

lower boundsload balancingballs and binsstatic randomized parallel allocation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Cites Work

• SOFSEM 2010: Theory and practice of computer science. 36th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 23--29, 2010. Proceedings
• Allocating weighted jobs in parallel
• Parallel Randomized Load Balancing: A Lower Bound for a More General Model
• Revisiting Randomized Parallel Load Balancing Algorithms
• How asymmetry helps load balancing
• Balanced Allocations
• Parallel randomized load balancing
• Contention Resolution in Hashing Based Shared Memory Simulations
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel randomized load balancing: a lower bound for a more general model