WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal periodic remapping of dynamic bulk synchronous computations
Journal of Parallel and Distributed Computing
Fun-sort--or the chaos of unordered binary search
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Automatica (Journal of IFAC)
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
Smoothed Analysis of Balancing Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Accelerated distributed average consensus via localized node state prediction
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
On quantized consensus by means of gossip algorithm: part i: convergence proof
ACC'09 Proceedings of the 2009 conference on American Control Conference
Load balancing over heterogeneous networks with gossip-based algorithms
ACC'09 Proceedings of the 2009 conference on American Control Conference
On quantized consensus by means of gossip algorithm: part ii: convergence time
ACC'09 Proceedings of the 2009 conference on American Control Conference
Adaptive fast consensus algorithm for distributed sensor fusion
Signal Processing
Discrete load balancing is (almost) as easy as continuous load balancing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Convergence of consensus models with stochastic disturbances
IEEE Transactions on Information Theory
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A new analytical method for parallel, diffusion-type load balancing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Dynamic diffusion load balancing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Randomized diffusion for indivisible loads
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Deterministic random walks on the two-dimensional grid
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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
Periodic load balancing on the N-cycle: analytical and experimental evaluation
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Brief announcement: threshold load balancing in networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Parallel rotor walks on finite graphs and applications in discrete load balancing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.07 |
We develop a general technique for the quantitative analysis of iterative distributed load balancing schemes. We illustrate the technique by studying two simple, intuitively appealing models that are prevalent in the literature: the diffusive paradigm, and periodic balancing circuits (or the dimension exchange paradigm). It is well known that such load balancing schemes can be roughly modeled by Markov chains, but also that this approximation can be quite inaccurate. Our main contribution is an effective way of characterizing the deviation between the actual loads and the distribution generated by a related Markov chain, in terms of a natural quantity which we call the local divergence. We apply this technique to obtain bounds on the number of rounds required to achieve coarse balancing in general networks, cycles and meshes in these models. For balancing circuits, we also present bounds for the stronger requirement of perfect balancing, or counting.