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
Load balancing and routing on the hypercube and related networks
Journal of Parallel and Distributed Computing
Programming a Hypercube Multicomputer
IEEE Software
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
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
A perfect load balancing algorithm on cube-connected cycles
CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
The load balancing problem in OTIS-Hypercube interconnection networks
The Journal of Supercomputing
The Journal of Supercomputing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
This paper proposes a simple yet efficient algorithm to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. This algorithm was developed based upon 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. This algorithm achieves a perfect load balance over P processors with an error of 1 and the worst-case time complexity of O(M log2P), where M is the maximum number of tasks initially assigned to each processor. Furthermore, perfect load balance is achieved over subcubes as well—once a hypercube is balanced, if the cube is decomposed into two subcubes by the lowest bit of node addresses, then the difference between the numbers of the total tasks of these subcubes is at most 1.