Issue No. 10 - October (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.99188
<p>A semidistributed approach is given for load balancing in large parallel and distributed systems which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distributed or multiprocessor system into independent symmetric regions (spheres) centered at some control points. The central points, called schedulers, optimally schedule tasks within their spheres and maintain state information with low overhead. The authors consider interconnection structures belonging to a number of families of distance transitive graphs for evaluation, and, using their algebraic characteristics, show that identification of spheres and their scheduling points is in general an NP-complete problem. An efficient solution for this problem is presented by making exclusive use of a combinatorial structure known as the Hadamard matrix. The performance of the proposed strategy has been evaluated and compared with an efficient fully distributed strategy through an extensive simulation study. The proposed strategy yielded much better results.</p>
massively parallel multicomputer systems; semidistributed approach; load balancing; distributed systems; fully distributed approaches; two-level hierarchical control; interconnection structure; multiprocessor system; independent symmetric regions; state information; interconnection structures; distance transitive graphs; scheduling points; NP-complete problem; combinatorial structure; Hadamard matrix; fully distributed strategy; simulation study; computational complexity; multiprocessor interconnection networks; parallel architectures; parallel machines; scheduling
A. Ghafoor and I. Ahmad, "Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 987-1004, 1991.