
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.H. Bokhari, "A Network Flow Model for Load Balancing in CircuitSwitched Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 649657, June, 1993.  
BibTex  x  
@article{ 10.1109/71.242158, author = {S.H. Bokhari}, title = {A Network Flow Model for Load Balancing in CircuitSwitched Multicomputers}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {6}, issn = {10459219}, year = {1993}, pages = {649657}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.242158}, 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 Network Flow Model for Load Balancing in CircuitSwitched Multicomputers IS  6 SN  10459219 SP649 EP657 EPD  649657 A1  S.H. Bokhari, PY  1993 KW  Index Termsnetwork flow model; load balancing; circuitswitched multicomputers; wormhole routing;hypercube; minimum cost flow algorithm; contention free matching; concurrency control; hypercube networks; multiprocessing systems VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
In multicomputers that utilize circuit switching or wormhole routing, communicationoverhead depends largely on link contentionthe variation due to distance between nodesis negligible. This has a major impact on the load balancing problem. In this case there are some nodes with an excess load (sources) and other with a deficit load (sinks). Amatching of sources to sinks is required to avoid contention. The problem is madecomplex by the hardwired routing on currently available machines: The user can controlonly which nodes communicate but not how the messages are routed. Network flowmodels of message flow in the mesh and the hypercube have been developed to solvethis problem. The crucial property of these models is the correspondence betweenminimum cost flows and correctly routed messages. To solve a given load balancingproblem, a minimum cost flow algorithm is applied to the network. This permits theefficient determination of a maximum contention free matching of sources to sinks that, in turn, tells how much of the given imbalance can be eliminated without contention.
[1] G. Barneset al., "The IlliacIV computer,"IEEE Trans. Comput., vol. C17, pp. 746757, 1968.
[2] S. H. Bokhari, "Communication overheads on the Intel iPSC860 hypercube," ICASE Interim Rep. 10, May 1990, NASA CR 182055.
[3] L. Bomans and D. Roose, "Benchmarking the iPSC/2 hypercube multiprocessor,"Concurrency: Practice and Experience, vol. 1, no. 1, pp. 318, Sept. 1989.
[4] S. Borkar et al., "iWarp: An Integrated Solution to High Speed Parallel Computing,"Proc. Supercomputing 88, Vol. 1, CS Press, Los Alamitos, Calif., Order No. 882, pp. 330339.
[5] R. G. Busacker and P. J. Gowen, "A procedure for determining a family of minimalcost network flow patterns," Tech. Rep. 15, O.R.O., Johns Hopkins Univ., 1961.
[6] R. G. Busacker and T. L. Saaty,Finite Graphs and Networks. New York: McGrawHill, 1964.
[7] S. Chittor and R. Enbody, "Performance analysis of Symult 2010's interprocessor communication network," Tech. Rep. CPS8919, Dep. Comput. Sci., Michigan State Univ., 1989.
[8] Intel Corp., Touchstonedelta programmers reference manual, Aug. 1991.
[9] Intel Corp., iPSC/2 and iPSC/860 programmers reference manual, June 1990.
[10] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[11] E. W. Dijkstra, "A note on two problems in connexion with graphs,"Numerische Mathematik, vol. 1, pp. 269271, 1959.
[12] J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems,"J. Ass. Comput. Mach., vol. 19, no. 2, pp. 248264, Apr. 1972.
[13] D. C. Grunwald, "Circuit switched multicomputers and heuristic load placement," Ph.D. thesis, Dep. of Comput. Sci., Univ. of Illinois at UrbanaChampaign, Sept. 1989.
[14] T. Hoshino,PAX Computer: High Speed Parallel Processing and Scientific Computing. Reading, MA: AddisonWesley, 1989.
[15] T. Hoshino, "An Invitation to the world of PAX,"IEEE Comput. Mag., vol. 19, no. 5, pp. 6879, May 1986.
[16] T. C. Hu,Combinatorial Algorithms. Reading, MA: AddisonWesley, 1982.
[17] E. L. Lawler,Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
[18] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[19] C. L. Seitzet al., "The architecture and programming of the Ametek Series 2010 Multicomputer," inProc. Third Conf. Hypercube Concurrent Comput. Appl., ACM, Jan. 1988, pp. 3337.
[20] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105117.
[21] R. Endre Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.