
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YiChieh Chang, Kang G. Shin, "A Coordinated Location Policy for Load Sharing in HypercubeConnected Multicomputers," IEEE Transactions on Computers, vol. 44, no. 5, pp. 669682, May, 1995.  
BibTex  x  
@article{ 10.1109/12.381952, author = {YiChieh Chang and Kang G. Shin}, title = {A Coordinated Location Policy for Load Sharing in HypercubeConnected Multicomputers}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {5}, issn = {00189340}, year = {1995}, pages = {669682}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.381952}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Coordinated Location Policy for Load Sharing in HypercubeConnected Multicomputers IS  5 SN  00189340 SP669 EP682 EPD  669682 A1  YiChieh Chang, A1  Kang G. Shin, PY  1995 KW  Load sharing KW  hypercubeconnected multicomputers KW  location policy KW  buddy sets KW  preferred lists KW  random probing and selection KW  bidding algorithm. VL  44 JA  IEEE Transactions on Computers ER   
[1] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computernetwork,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, 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 ncube?” Proc. 27th Ann. Symp. on Foundations of Computer Science, pp. 283291, 1986.
[4] M.S. Chen and K.G. Shin, "Adaptive FaultTolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,4061,416, Dec. 1990.
[5] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,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. C37, pp. 1396–1407, Dec. 1987.
[7] K.G. Shin and Y.C. Chang, "Load Sharing in Distributed RealTime Systems with State Change Broadcasts," IEEE Trans. Computers, vol. 38, no. 8, pp. 1,12241,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. 662675, May 1986.
[9] R. G. Smith,“The contract net protocol: Highlevel communication and control in adistributed problem solver,” IEEE Trans. Computers, vol. 29, no. 12, pp. 1,1041,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 unixbased local computer network with load balancing,” Computer, vol. 15, no. 4, pp. 5564, 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. 11531161, 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. 3134, 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. 564577, 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. 314323, 1981.
[15] F. Harary,Graph Theory.Boston, Mass.: AddisonWesley, 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. 502509, 1990.