A new analytical method for parallel, diffusion-type load balancing

Authors:
Petra Berenbrink;Tom Friedetzky;Zengjian Hu
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada;Department of Computer Science, Durham University, Durham, DH1 3LE, UK;D-Wave Systems, Burnaby, B.C., V5C 6G9, Canada
Venue:
Journal of Parallel and Distributed Computing
Year:
2009

Citing 12
Cited 4

Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Load balancing and Poisson equation in a graph

Concurrency: Practice and Experience
An analysis of diffusive load-balancing

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Tight Analyses of Two Local Load Balancing Algorithms

SIAM Journal on Computing
Balanced Allocations

SIAM Journal on Computing
Load balancing of unit size tokens and expansion properties of graphs

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fast convergence to Wardrop equilibria by adaptive sampling methods

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Near-perfect load balancing by randomized rounding

Proceedings of the forty-first annual ACM symposium on Theory of computing
Biased random walks on resource network graphs for load balancing

The Journal of Supercomputing
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods

SIAM Journal on Computing
Distributed selfish load balancing on networks

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new proof technique which can be used to analyse many parallel load balancing algorithms. The technique is designed to handle concurrent load balancing actions, which are often the main obstacle in the analysis. We demonstrate the usefulness of the approach by analysing various natural diffusion-type protocols. Our results are similar to, or better than, previously existing ones, while our proofs are much easier. The key idea is to first sequentialise the original, concurrent load transfers, analyse this new, sequential system, and then to bound the gap between both.