Balls into non-uniform bins

DOI10.1016/J.JPDC.2013.10.008MaRDI QIDQ897392zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 5764855 (Why is no real title available?)
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• scientific article; zbMATH DE number 2038734 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 1559581 (Why is no real title available?)
• Balanced allocation on graphs
• Balanced allocations (extended abstract)
• Balanced allocations: the heavily loaded case
• Balls into bins with related random choices
• Distributed selfish load balancing with weights and speeds
• Space efficient hash tables with worst case constant access time

Cited in

(5)

• Balls into bins with related random choices
• Serving in the dark should be done non-uniformly
• Parallel load balancing on constrained client-server topologies
• New techniques and tighter bounds for local computation algorithms
• 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)