Tight bounds for parallel randomized load balancing
From MaRDI portal
Recommendations
- Tight bounds for parallel randomized load balancing, extended abstract
- Parallel randomized load balancing: a lower bound for a more general model
- Parallel randomized load balancing: a lower bound for a more general model
- Revisiting randomized parallel load balancing algorithms
- Revisiting Randomized Parallel Load Balancing Algorithms
- scientific article; zbMATH DE number 1263199
- Tight Bounds for Selfish and Greedy Load Balancing
- Tight bounds for selfish and greedy load balancing
- Parallel randomized load balancing
Cites work
- scientific article; zbMATH DE number 4215352 (Why is no real title available?)
- scientific article; zbMATH DE number 5485459 (Why is no real title available?)
- scientific article; zbMATH DE number 1263199 (Why is no real title available?)
- scientific article; zbMATH DE number 1306871 (Why is no real title available?)
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- A new technique for distributed symmetry breaking
- Allocating weighted jobs in parallel
- Approximate equilibria and ball fusion
- Balanced Allocations
- Balanced allocation on graphs
- Balls and bins: A study in negative dependence
- Distributed MST for constant diameter graphs
- Distributed Selfish Load Balancing
- Distributed verification and hardness of distributed approximation
- Efficient PRAM simulation on a distributed memory machine
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Exploiting storage redundancy to speed up randomized shared memory simulations
- How asymmetry helps load balancing
- Hundreds of impossibility results for distributed computing
- Load balancing without regret in the bulletin board model
- Locality in Distributed Graph Algorithms
- On weighted balls-into-bins games
- Optimal deterministic routing and sorting on the congested clique
- Parallel randomized load balancing: a lower bound for a more general model
- Randomized allocation processes
- Revisiting Randomized Parallel Load Balancing Algorithms
- The Tree Model for Hashing: Lower and Upper Bounds
- The \((1 + {\beta})\)-choice process and weighted balls-into-bins
- The log-star revolution
- The round complexity of distributed sorting, extended abstract
- Tight bounds for parallel randomized load balancing, extended abstract
- What cannot be computed locally!
Cited in
(14)- scientific article; zbMATH DE number 1263231 (Why is no real title available?)
- Load balancing: An exercise in constrained convergence
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
- Parallel randomized load balancing: a lower bound for a more general model
- Parallel randomized load balancing: a lower bound for a more general model
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
- scientific article; zbMATH DE number 742953 (Why is no real title available?)
- Tight Analysis of Parallel Randomized Greedy MIS
- A lower bound on the queueing delay in resource constrained load balancing
- A load balancing strategy for parallel computation of sparse permanents.
- Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load states information
- Revisiting Randomized Parallel Load Balancing Algorithms
This page was built for publication: Tight bounds for parallel randomized load balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287991)
