The generalized packet routing problem
Theoretical Computer Science
The token distribution problem
SIAM Journal on Computing
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Analysis of a graph coloring based distributed load balancing algorithm
Journal of Parallel and Distributed Computing
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
The influence of graph structure on generalized dimension exchange
Information Processing Letters
The generalized dimension exchange method for load balancing in k-ary n-cubes and variants
Journal of Parallel and Distributed Computing
Dynamic load balancing by random matchings
Journal of Computer and System Sciences
Dimension-exchange token distribution on the mesh and the torus
Parallel Computing
Transition-optimal token distribution
Fundamenta Informaticae
Optimal dimension-exchange token distribution on complete binary trees
Theoretical Computer Science
An improved diffusion algorithm for dynamic load balancing
Parallel Computing
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
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Programming a Hypercube Multicomputer
IEEE Software
Load balancing on the hypoercube and shuffle-exchange
Load balancing on the hypoercube and shuffle-exchange
Automatica (Journal of IFAC)
Some distributed algorithms for quantized consensus problem
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Hi-index | 0.00 |
Load balancing on a multi-processor system involves redistributing tasks among processors so that each processor has roughly the same amount of work to perform. The token-distribution problem is a static variant of the load balancing problem for the case in which the workloads in the system cannot be divided arbitrarily; that is, where each token represents an atomic element of work. A scalable method for distributing tokens over a parallel architecture is the so-called dimension-exchange approach. Our results include improved analysis of two existing dimension-exchange algorithms for token distribution on arbitrary graphs and on arbitrary trees, respectively. In particular, we establish a logarithmic upper bound on the discrepancy of the resulting distribution when the second algorithm is applied to an arbitrary initial distribution on a tree. We then present a new dimension-exchange algorithm for token distribution on trees, which assuming each node knows the number of nodes in the tree, determines a 'perfectly balanced' distribution. Furthermore, the rate of convergence is worst-case optimal for trees of bounded degree. Note that an algorithm for token-distribution on trees is applicable to arbitrary architectures, since the algorithm can be applied on a spanning tree of any given connected graph.