
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.J. Chuang, N.F. Tzeng, "A Fast RecognitionComplete Processor Allocation Strategy for Hypercube Computers," IEEE Transactions on Computers, vol. 41, no. 4, pp. 467479, April, 1992.  
BibTex  x  
@article{ 10.1109/12.135559, author = {P.J. Chuang and N.F. Tzeng}, title = {A Fast RecognitionComplete Processor Allocation Strategy for Hypercube Computers}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {4}, issn = {00189340}, year = {1992}, pages = {467479}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.135559}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Fast RecognitionComplete Processor Allocation Strategy for Hypercube Computers IS  4 SN  00189340 SP467 EP479 EPD  467479 A1  P.J. Chuang, A1  N.F. Tzeng, PY  1992 KW  processor allocation strategy; hypercube computers; binary tree representations; performance measures; allocation strategies; complete subcube recognition; computational complexity; hypercube networks; performance evaluation; resource allocation. VL  41 JA  IEEE Transactions on Computers ER   
Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A method with much less complexity than the multipleGC 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. 867872, July 1988.
[2] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[3] Intel Corp.,A New Direction in Scientific Computing, Order #28 009001, 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 microprocessorbased hypercube supercomputer,"IEEE Micro, vol. 6, pp. 617, 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. 649652.
[8] J. C. Petersonet al., "The Mark III hypercubeensemble concurrent computer," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 7173.
[9] M.S. Chen and K. G. Shin, "Processor allocation in anNcube multiprocessorusing Gray codes,"IEEE Trans. Comput., vol. C36, no. 12, pp. 13961407, Dec. 1987.
[10] K. C. Knowlton, "A fast storage allocator,"Commun. ACM, vol. 8, no. 10, pp. 623625, 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. 105111.
[12] A. AlDhelaan and B. Bose, "A new strategy for processor allocation in an Ncube multiprocessor," inProc. Phoenix Conf. Comput. and Commun., Mar. 1989, pp. 114118.
[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 231238.
[14] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, 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. 4049.