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

Authors:
Petra Berenbrink;Tom Friedetzky;Zengjian Hu
Affiliations:
Simon Fraser University, School of Computing Science, Burnaby, BC, Canada;Durham University, Department of Computer Science Science Labs, England, U.K.;Simon Fraser University, School of Computing Science, Burnaby, BC, Canada
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 11
Cited 3

The token distribution problem

SIAM Journal on Computing
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
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
An asynchronous and iterative load balancing algorithm for discrete load model

Journal of Parallel and Distributed 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

Perfect load balancing on the star interconnection network

The Journal of Supercomputing
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Myopic distributed protocols for singleton and independent-resource congestion games

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new proof technique which can be used to analyze 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 analyzing 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 sequentialize the original, concurrent load transfers, analyze this new, sequential system, and then to bound the gap between both.