Revisiting Randomized Parallel Load Balancing Algorithms

DOI10.1007/978-3-642-11476-2_17zbMath1274.68029OpenAlexW2168879523MaRDI QIDQ3408172

Guy Even, Moti Medina

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_17

zbMATH Keywords

martingalesload balancingballs and binsstatic randomized parallel allocation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

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

Cites Work

• Allocating weighted jobs in parallel
• How asymmetry helps load balancing
• Balanced Allocations
• Parallel randomized load balancing
• Contention Resolution in Hashing Based Shared Memory Simulations
• Probability and Computing
• Unnamed Item

This page was built for publication: Revisiting Randomized Parallel Load Balancing Algorithms