
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Li, H. Kameda, "A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 5, pp. 540548, May, 1994.  
BibTex  x  
@article{ 10.1109/71.282565, author = {J. Li and H. Kameda}, title = {A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {5}, issn = {10459219}, year = {1994}, pages = {540548}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.282565}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Network Configurations IS  5 SN  10459219 SP540 EP548 EPD  540548 A1  J. Li, A1  H. Kameda, PY  1994 KW  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; DafermosSparrow algorithm; FlowDeviation algorithm; load balancing; convergence; CPU time; algorithm performance;computer networks; star network configuration VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 DafermosSparrow (DS) 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 nnode system. However, the amount of the storage required for the DS algorithm is O(n log(n)). By using numerical experiments, we show that both the proposed algorithm and the DS algorithm have much faster convergence in terms of central processing unit(CPU) time than the FD algorithm.
[1] D. G. Cantor and M. Gerla, "Optimal routing in a packetswitched computer network,"IEEE Trans. Comput., vol. C23, no. 10, pp. 10621069, Oct. 1974.
[2] P. J. Courtois,Decomposability: Queueing and Computer System Applications. New York: Academic, 1977.
[3] S. C. Dafermos and F. T. Sparrow, "The traffic assignment problem for a general network,"J. Res. National Bureau StandardsB, vol. 73B, no. 2, pp. 91118, 1969.
[4] L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to storeandforward communication network design,"Networks, vol. 3, pp. 97133, 1973.
[5] M. D. Intriligator,Mathematical Optimization and Economic Theory. Englewood Cliffs, NJ: PrenticeHall, 1971.
[6] H. Kameda and A. Hazeyama, "Individual vs. overall optimization for static load balancing in distributed computer systems," Comput. Sci. Rep., Univ. of ElectroCommun., Japan, 1988.
[7] C. Kim and H. Kameda, "An algorithm for optimal static load balancing in distributed computer systems,"IEEE Trans. Comput., vol. 41, pp. 381384, 1992.
[8] L. Kleinrock,Queueing Systems: Computer Applications, Vol. 2. New York: Wiley, 1976.
[9] J. G. Lee, W. G. Vogt, and M. H. Mickle, "Optimal decomposition of largescale networks,"IEEE Trans. Syst., Man, Cybernetics, vol. SMC9, no. 7, pp. 369375, July 1979.
[10] T. Leventhal, G. Nemhauser, and L. Trotter, "A column generation algorithm for optimal traffic assignment,"Transp. Sci., vol. 7, pp. 168176, 1973.
[11] T. L. Magnanti, "Models and algorithms for predicting urban traffic equilibria,"Transportation Planning Models. M. Florian, Ed. Amsterdam: Elsevier B.V. (NorthHolland), 1984, pp. 153185.
[12] A. B. Nagurney, "Comparative tests of multimodal traffic equilibrium methods,"Transp. Res.B, vol. 18B, no. 6, pp. 469485, 1984.
[13] M. Schwartz,ComputerCommunication Network Design and Analysis. Englewood Cliffs, NJ: PrenticeHall, 1977.
[14] A. Tanenbaum,Computer Networks. Englewood Cliffs, NJ: PrenticeHall, 1988.
[15] A. N. Tantawi and D. Towsley, "A general model for optimal static load balancing in star network configurations," inProc. Performance '84, pp. 277291.
[16] A. N. Tantawi and D. Towsley, "Optimal static load balancing in distributed computer systems,"J. ACM, pp. 445465, Apr. 1985.