This Article 
 Bibliographic References 
 Add to: 
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers
April 1992 (vol. 41 no. 4)
pp. 467-479

Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A method with much less complexity than the multiple-GC strategy in generating the search space, while achieving complete subcube recognition, is proposed. This method is referred to as a dynamic processor allocation scheme because the search space generated is dependent on the dimension of the requested subcube dynamically. The basic idea lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are distant are brought close to each other for recognition. The strategy can be implemented efficiently by using right rotating operations on the notations of the sets of subcubes corresponding to the nodes at a certain level of binary tree representations. Results of extensive simulation runs carried out to collect performance measures for different allocation strategies are discussed. It is shown that this strategy compares favorably in most situations with other known allocation schemes capable of achieving complete subcube recognition.

[1] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[2] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[3] Intel Corp.,A New Direction in Scientific Computing, Order #28 009-001, Intel Corp., 1985.
[4] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[5] Ametek System 14 User's Guide: C Edition, Ametek Computer Research Division, Arcadia, CA, 1986.
[6] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, Oct. 1986.
[7] H. L. Gustafson, S. Hawkinson, and K. Scott, "The architecture of a homogeneous vector supercomputer," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 649-652.
[8] J. C. Petersonet al., "The Mark III hypercube-ensemble concurrent computer," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 71-73.
[9] M.-S. Chen and K. G. Shin, "Processor allocation in anN-cube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C-36, no. 12, pp. 1396-1407, Dec. 1987.
[10] K. C. Knowlton, "A fast storage allocator,"Commun. ACM, vol. 8, no. 10, pp. 623-625, Oct. 1965.
[11] M.-S. Chen and K. G. Shin, "Task migration in hypercube multiprocessors," inProc. 16th Annu. Int. Symp. Comput. Architecture, May 1989, pp. 105-111.
[12] A. Al-Dhelaan and B. Bose, "A new strategy for processor allocation in an N-cube multiprocessor," inProc. Phoenix Conf. Comput. and Commun., Mar. 1989, pp. 114-118.
[13] J. Kim, C. R. Das, and W. Lin, "A processor allocation scheme for hypercube computers," inProc. 1989 Int. Conf. Parallel Processing, Aug. 1989, pp. II 231-238.
[14] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
[15] P.-J. Chuang and N.-F. Tzeng, "Dynamic processor allocation in hypercube computers," inProc. 17th Annu. Int. Symp. Comput. Architecture, May 1990, pp. 40-49.

Index Terms:
processor allocation strategy; hypercube computers; binary tree representations; performance measures; allocation strategies; complete subcube recognition; computational complexity; hypercube networks; performance evaluation; resource allocation.
P.-J. Chuang, N.-F. Tzeng, "A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers," IEEE Transactions on Computers, vol. 41, no. 4, pp. 467-479, April 1992, doi:10.1109/12.135559
Usage of this product signifies your acceptance of the Terms of Use.