This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
May 1995 (vol. 44 no. 5)
pp. 669-682

Abstract—Uneven task arrivals in a hypercube-connected multicomputer may temporarily overload some nodes while leaving others underloaded. This problem can be solved or alleviated by load sharing (LS); that is, some of the tasks arriving at overloaded nodes, called overflow tasks, are transferred to underloaded nodes. One important issue in LS is to locate underloaded nodes to which the overflow tasks can be transferred. This is termed the location policy. Any efficient location policy should distribute the overflow tasks to the entire system instead of ’dumping’ them on a few underloaded nodes. To reduce the overhead for collecting state information and transferring tasks, each node is required to maintain the state information of only those nodes in its proximity, called a buddy set. Several location policies—random probing, random selection, preferred lists, and bidding algorithm—are analyzed and compared for hypercube-connected multicomputer systems. Under the random-selection and preferred-list policies, an overloaded node can select, without probing other nodes, an underloaded node within its buddy set, while under the random probing policy and the bidding algorithm the overloaded node needs to probe other nodes before transferring the overflow task. Task collision(s) is said to occur if two or more overflow tasks are transferred (almost) simultaneously to the same underloaded node. The performances of these location policies are analyzed and compared in terms of the average number of task collisions. Our analysis shows that use of preferred lists allows the overflow tasks to be shared more evenly throughout the entire hypercube than the other two location policies.

[1] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computernetwork,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[2] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[3] B. Becker and H.U. Simon,“How robust is the n-cube?” Proc. 27th Ann. Symp. on Foundations of Computer Science, pp. 283-291, 1986.
[4] M.-S. Chen and K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,406-1,416, Dec. 1990.
[5] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,654-1,657, Dec. 1988.
[6] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[7] K.G. Shin and Y.-C. Chang, "Load Sharing in Distributed Real-Time Systems with State Change Broadcasts," IEEE Trans. Computers, vol. 38, no. 8, pp. 1,1224-1,142, Aug. 1989.
[8] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "Adaptive Load Sharing in Homogeneous Distributed Systems," IEEE Trans. Software Eng., vol. 12, no. 5, pp. 662-675, May 1986.
[9] R. G. Smith,“The contract net protocol: High-level communication and control in adistributed problem solver,” IEEE Trans. Computers, vol. 29, no. 12, pp. 1,104-1,113, Dec. 1980.
[10] K. Hwang,W.J. Croft,G. H. Goble,B.W. Wah,F.A. Briggs,W.R. Simmons,, and C.L. Coates,“A unix-based local computer network with load balancing,” Computer, vol. 15, no. 4, pp. 55-64, Apr. 1982.
[11] L.M. Ni, C. Xu, and T.B. Gendreau, “A Distributed Drafting Algorithm for Load Balancing,” IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1153-1161, Oct. 1985.
[12] D.J. Farber,J. Feldman,F.R. Heinrich,M.D. Hopwood,K.C. Larson,D.C. Loomis,, and L.A. Rowe,“The distributed computing system,” IEEE COMPCON Spring, pp. 31-34, 1973.
[13] W. Zhao, K. Ramamritham, and J.A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real Time Systems,” IEEE Trans. Software Eng., vol. 13, no. 5, pp. 564-577, May 1987.
[14] R.M. Bryant and R.A. Finkel,“A stable distributed scheduling algorithm,” IEEE Proc. Second Int’l Conf. on Dist. Comp. Systems, pp. 314-323, 1981.
[15] F. Harary,Graph Theory.Boston, Mass.: Addison-Wesley, 1969.
[16] N.G. Shivaratri and P. Krueger,“Two adaptive location policies for global scheduling algorithms,” IEEE Proc. Fifth Int’l Conf. on Dist. Comp. Systems, pp. 502-509, 1990.

Index Terms:
Load sharing, hypercube-connected multicomputers, location policy, buddy sets, preferred lists, random probing and selection, bidding algorithm.
Citation:
Yi-Chieh Chang, Kang G. Shin, "A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers," IEEE Transactions on Computers, vol. 44, no. 5, pp. 669-682, May 1995, doi:10.1109/12.381952
Usage of this product signifies your acceptance of the Terms of Use.