Perfectly balanced allocation

DOI10.1007/B11961MaRDI QIDQ5900937zbMATH OpenOpenAlexFDO

Authors Artur Czumaj, Chris Riley, Christian Scheideler

Publication date 26 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Recommendations

• Randomized allocation processes
• scientific article; zbMATH DE number 1263199
• Balanced allocations: the heavily loaded case
• Balanced Allocations: The Heavily Loaded Case
• Balanced Allocations

Cited in

(40)

• On the analysis of randomized load balancing schemes
• Load balancing in hypergraphs
• Self-stabilizing repeated balls-into-bins
• Self-stabilizing balls and bins in batches. The power of leaky bins
• Discrete load balancing on complete bipartite graphs
• Load balancing under \(d\)-thinning
• Distributed balanced color assignment on arbitrary networks
• Balanced allocation and dictionaries with tightly packed constant size bins
• Analysis of randomized protocols for conflict-free distributed access
• On the power of two choices: balls and bins in continuous time
• Balanced allocations (extended abstract)
• Balls into bins made faster
• Multidimensional balanced allocations
• Balls into bins via local search: cover time and maximum load
• Balanced allocations: the heavily loaded case
• Performance of global load balancing by local adjustment
• Ultra-fast load balancing on scale-free networks
• How asymmetry helps load balancing
• Graphical balanced allocations and the (1+ )-choice process
• A stochastic process on the hypercube with applications to peer-to-peer networks
• Balanced Allocations
• Randomized load balancing by joining and splitting bins
• scientific article; zbMATH DE number 2016893 (Why is no real title available?)
• Chains-into-bins processes
• Balanced allocation: memory performance tradeoffs
• The power of two choices with simple tabulation
• Consistent hashing with bounded loads
• Optimal ball recycling
• A generalization of multiple choice balls-into-bins: tight bounds
• scientific article; zbMATH DE number 975417 (Why is no real title available?)
• Self-stabilizing balls \& bins in batches: the power of leaky bins (extended abstract)
• The \((1 + {\beta})\)-choice process and weighted balls-into-bins
• Balanced Allocations: The Heavily Loaded Case
• Algorithms and Computation
• Balls into bins via local search: cover time and maximum load
• Balls into bins via local search
• Recovery time of dynamic allocation processes
• Load optimization in a planar network
• Private join and compute from PIR with default
• Balls into non-uniform bins

This page was built for publication: Perfectly balanced allocation

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