Parallel Randomized Load Balancing: A Lower Bound for a More General Model

DOI10.1007/978-3-642-11266-9_30zbMath1274.68132OpenAlexW1740307415MaRDI QIDQ3401104

Guy Even, Moti Medina

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_30

zbMATH Keywords

lower boundsload balancingballs and binsstatic randomized parallel allocation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (3)

Tight bounds for parallel randomized load balancing ⋮ Revisiting randomized parallel load balancing algorithms ⋮ Parallel randomized load balancing: a lower bound for a more general model

This page was built for publication: Parallel Randomized Load Balancing: A Lower Bound for a More General Model