This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
August 1995 (vol. 44 no. 8)
pp. 1051-1055

Abstract—Traditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper presents a 2D-mesh cluster allocation strategy for hypercubes. The proposed auxiliary free list processor allocation strategy can efficiently allocate 2D-mesh clusters without size constraints, can reduce average job turnaround time compared with that based on subcube allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlock-free E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.

[1] K.C. Knowlton, “A Fast Storage Allocator,” Comm. ACM, vol. 8, pp. 623-625, Oct. 1965.
[2] 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.
[3] A. Al-Dhelaan and B. Bose,“A new strategy for processor allocation in an n-cube multiprocessor,” Proc. Int’l Phoenix Conf. Computers and Comm., pp. 114-118, Mar. 1989.
[4] J. Kim, C.R. Das, and W. Lin, “A Top-Down Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991.
[5] P.-J. Chuang and N.-F. Tzeng,"A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers," IEEE Trans. Computers, pp. 467-479, Apr. 1992.
[6] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[7] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[8] M.Y. Chan and F.Y.L. Chin, "On Embedding Rectangular Grids in Hypercubes," IEEE Trans. Computers, vol. 37, no. 10, pp. 1,285-1,288, Oct. 1988.
[9] S.W. Turner,L.M. Ni,, and B.H.C. Cheng,“Contention-free 2D-mesh cluster allocation in hypercubes,” Tech. Report MSU-CPS-ACS-76, Michigan State Univ. Dept. of Computer Science, East Lansing, MI 48824, Nov. 1992. (ftp=ftp.cps.msu.edu:/pub/acs/reports/msu-cps-acs-76.ps).
[10] Y. Zhu,“Efficient processor allocation strategies for mesh-connected parallel computers,” J. Parallel and Distributed Computing, vol. 16, pp. 328-337, 1992.
[11] P. Krueger,T.-H. Lai,, and V.A. Radiya,“Processor allocation vs. job scheduling on hypercube computers,” Proc. 11th Int’l Conf. Distributed Computing Systems,Arlington, Tex., pp. 394-401, 1991.

Index Terms:
Hypercube, processor allocation, 2Dimensional mesh, job turnaround time, message routing.
Citation:
Lionel M. Ni, Stephen W. Turner, Betty H.C. Cheng, "Contention-Free 2D-Mesh Cluster Allocation in Hypercubes," IEEE Transactions on Computers, vol. 44, no. 8, pp. 1051-1055, Aug. 1995, doi:10.1109/12.403722
Usage of this product signifies your acceptance of the Terms of Use.