The Community for Technology Leaders
Green Image
<p>We study the static load balancing problem in a distributed computer system with thetree hierarchy configuration. It is formulated as a nonlinear optimization problem. Afterstudying the conditions that the solution to the optimization problem of the tree hierarchynetwork satisfies, we demonstrate that the special structure of the optimization problemleads to an interesting decomposition technique. A new effective decomposition algorithm to solve the optimization problem is presented. The proposed algorithm Is compared with two other well known algorithms: the Flow Deviation (FD) algorithm and the Dafermos-Sparrow (D-S) algorithm. It is shown that the amounts of the storage required for the proposed algorithm and the FD algorithm are O(n) for load balancing of an n-node system. However, the amount of the storage required for the D-S algorithm is O(n log(n)). By using numerical experiments, we show that both the proposed algorithm and the D-S algorithm have much faster convergence in terms of central processing unit(CPU) time than the FD algorithm.</p>
Index Termsresource allocation; multiprocessor interconnection networks; computational complexity;distributed memory systems; convergence of numerical methods; decompositionalgorithm; optimal static load balancing; tree hierarchy network configurations;distributed computer system; optimization problem; Dafermos-Sparrow algorithm; FlowDeviation algorithm; load balancing; convergence; CPU time; algorithm performance;computer networks; star network configuration
H. Kameda, J. Li, "A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 540-548, May 1994, doi:10.1109/71.282565
102 ms
(Ver 3.3 (11022016))