Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Priority Queues and Sorting Methods for Parallel Simulation
IEEE Transactions on Software Engineering
An asynchronous and iterative load balancing algorithm for discrete load model
Journal of Parallel and Distributed Computing
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
A new analytical method for parallel, diffusion-type load balancing
Journal of Parallel and Distributed Computing
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing
Sand automata as cellular automata
Theoretical Computer Science
Discrete load balancing is (almost) as easy as continuous load balancing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A new analytical method for parallel, diffusion-type load balancing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Randomized diffusion for indivisible loads
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Basic properties for sand automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Deterministic random walks on the two-dimensional grid
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A simple approach for adapting continuous load balancing processes to discrete settings
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Diffusion is a well-known algorithm for load-balancing in which tasks move from heavily-loaded processors to lightly-loaded neighbors. This paper presents a rigorous analysis of the performance of the diffusion algorithm on arbitrary networks.It is shown that the running time of the diffusion algorithm is bounded by: &OHgr;(log &sgr;/&Ggr;) ≤ Time ≤ O(N&sgr;/&Ggr;) and &OHgr;(log &sgr;/&Fgr;) ≤ Time ≤ O(&sgr;/&Fgr;2), where N is the number of nodes in the network, &sgr; is the standard deviation of the initial load distribution (which represents how imbalanced the load is initially), and &Ggr; and &Fgr; are the network's electrical and fluid conductances respectively (which are measures of the network's bandwidth).For the case of the generalized mesh with wrap-around (which includes common networks like the ring, 2D-torus, 3D-torus and hypercube), we derive tighter bounds and conclude that the diffusion algorithm is inefficient for lower dimensional meshes.