Balls into non-uniform bins

DOI10.1016/J.JPDC.2013.10.008zbMATH Open1327.68042DBLPjournals/jpdc/BerenbrinkBFN14OpenAlexW2045334063WikidataQ59202503 ScholiaQ59202503MaRDI QIDQ897392FDOQ897392

Authors: Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel 

Publication date: 18 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/17874/1/17874.pdf

Recommendations

• Balls into bins with related random choices
• Perfectly balanced allocation
• Allocating weighted jobs in parallel
• Randomized allocation processes
• How asymmetry helps load balancing

zbMATH Keywords

load balancingrandomised algorithmsballs-into-bins games

Mathematics Subject Classification ID

Randomized algorithms (68W20) Applications of game theory (91A80) Distributed systems (68M14) Combinatorial games (91A46)

Cites Work

• Title not available (Why is that?)
• Distributed selfish load balancing with weights and speeds
• Balanced allocation on graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balls into bins with related random choices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Space efficient hash tables with worst case constant access time
• Balanced allocations (extended abstract)
• Balanced allocations: the heavily loaded case

Cited In (6)

• Serving in the dark should be done non-uniformly
• Balls into bins with related random choices
• New techniques and tighter bounds for local computation algorithms
• Stochastic coordination in heterogeneous load balancing systems
• Parallel load balancing on constrained client-server topologies
• Long-term balanced allocation via thinning

This page was built for publication: Balls into non-uniform bins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897392)