Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:model
|
| gptkbp:alsoKnownAs |
balls and bins problem
|
| gptkbp:application |
distributed systems
parallel computing hash table design load balancing in networks |
| gptkbp:describes |
random allocation of objects into containers
|
| gptkbp:field |
gptkb:probability_theory
theoretical computer science combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Balls-into-bins model
|
| gptkbp:notableAchievement |
expected number of empty bins is n * exp(-m/n) for m balls and n bins
maximum load is about (log n / log log n) for n balls and n bins |
| gptkbp:parameter |
number of balls
number of bins |
| gptkbp:relatedTo |
hash functions
birthday problem coupon collector problem |
| gptkbp:studies |
collision probability
distribution of balls in bins expected number of empty bins maximum load in bins |
| gptkbp:typicalAssumption |
balls are placed independently and uniformly at random
|
| gptkbp:usedFor |
randomized algorithms
analyzing load balancing hashing analysis |
| gptkbp:variant |
non-uniform allocation
power of two choices weighted balls |
| gptkbp:bfsParent |
gptkb:Online_Load_Balancing
|
| gptkbp:bfsLayer |
7
|