Issue No.08 - August (1995 vol.44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.403722
<p><it>Abstract</it>—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.</p>
Hypercube, processor allocation, 2Dimensional mesh, job turnaround time, message routing.
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, August 1995, doi:10.1109/12.403722