Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Load balancing and routing on the hypercube and related networks
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Programming a Hypercube Multicomputer
IEEE Software
An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors
The Journal of Supercomputing
Distributing Tokens on a Hypercube without Error Accumulation
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Strongly Adaptive Token Distribution
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Effective Load Balancing on Highly Parallel Multicomputers Based on Superconcentrators
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Hi-index | 0.01 |
A simple yet efficient algorithm was presented by Jan and Huang recently to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. That algorithm was developed based on the well-known dimension exchange method. However, the error accumulation suffered by other algorithms based on the dimension exchange method is avoided by exploiting the notion of regular distributions, which are commonly deployed for data distributions in parallel programming. The cube-connected cycles (CCC) proposed by Preparata and Vuillemin are very similar in structure to the hypercube as an efficient general-purpose parallel system for its fixed-degree, and compact and regular layout. In this article, we propose a simple algorithm based on our previous work to distribute loads evenly on cube-connected cycles. This algorithm achieves perfect load balance over P processors with error of 1 and the worst-case time complexity of O(M log2 P), where M is the maximum load assigned to each processor initially. More importantly, it could achieve perfect load balance over subcubes as well --.if the cube is decomposed into two subcubes by bit 0, then the difference between the numbers of the total tasks in the subcubes is at most 1.