Studying Balanced Allocations with Differential Equations

DOI10.1017/S0963548399003946zbMATH Open0987.90088MaRDI QIDQ4934786FDOQ4934786

Authors: Michael Mitzenmacher 

Publication date: 30 January 2000

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Recommendations

• Balanced Allocation: Patience Is Not a Virtue
• Balanced allocation: patience is not a virtue
• Balanced allocations (extended abstract)
• Balanced Allocations
• Balanced allocations: the heavily loaded case

zbMATH Keywords

greedy algorithmdistributed load balancing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorial probability (60C05) Markov and semi-Markov decision processes (90C40) Stochastic processes (60G99)

Cited In (7)

• Almost all graphs with average degree 4 are 3-colorable
• Two-way chaining for non-uniform distributions
• Analyses of load stealing models based on families of differential equations
• A power-of-two-choices unbalanced allocation process
• On the power of two choices: balls and bins in continuous time
• Cuckoo hashing: Further analysis
• Randomized allocation processes

This page was built for publication: Studying Balanced Allocations with Differential Equations

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