Randomized allocation processes
From MaRDI portal
Publication:2746211
DOI10.1002/rsa.1011zbMath1011.68177OpenAlexW2031518092MaRDI QIDQ2746211
Publication date: 10 October 2001
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.1011
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items (13)
Balanced Allocation: Patience Is Not a Virtue ⋮ Tight bounds for parallel randomized load balancing ⋮ Graphical balanced allocations and the (1 + β)-choice process ⋮ The Power of Filling in Balanced Allocations ⋮ Self-stabilizing repeated balls-into-bins ⋮ A generalization of multiple choice balls-into-bins: tight bounds ⋮ Self-stabilizing balls and bins in batches. The power of leaky bins ⋮ Multiple choice tries and distributed hash tables ⋮ On the \(k\)-orientability of random graphs ⋮ A faster algorithm for cuckoo insertion and bipartite matching in large graphs ⋮ Group service system with three queues and load balancing ⋮ Two-way chaining for non-uniform distributions ⋮ Dynamic averaging load balancing on cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided tour of Chernoff bounds
- Probability approximations via the Poisson clumping heuristic
- Allocating weighted jobs in parallel
- On the Lambert \(w\) function
- Efficient PRAM simulation on a distributed memory machine
- Sudden emergence of a giant \(k\)-core in a random graph
- Fairness in Scheduling
- Balanced Allocations
- Parallel randomized load balancing
- Balls and bins: A study in negative dependence
- Studying Balanced Allocations with Differential Equations
- How useful is old information (extended abstract)?
- On contention resolution protocols and associated probabilistic phenomena
This page was built for publication: Randomized allocation processes
