
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
G.I. Chen, T.H. Lai, "Constructing Parallel Paths Between Two Subcubes," IEEE Transactions on Computers, vol. 41, no. 1, pp. 118123, January, 1992.  
BibTex  x  
@article{ 10.1109/12.123387, author = {G.I. Chen and T.H. Lai}, title = {Constructing Parallel Paths Between Two Subcubes}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {1}, issn = {00189340}, year = {1992}, pages = {118123}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.123387}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Constructing Parallel Paths Between Two Subcubes IS  1 SN  00189340 SP118 EP123 EPD  118123 A1  G.I. Chen, A1  T.H. Lai, PY  1992 KW  parallel paths; subcubes; hypercube system; circuitswitching hypercube network; parallel circuits; edgedisjoint; time complexity; computational complexity; hypercube networks. VL  41 JA  IEEE Transactions on Computers ER   
The authors consider a hypercube system that runs more than one job at a time, with each job allocated a subcube. They discuss the problem of migrating (relocating) a job from one subcube to another, assuming a circuitswitching hypercube network. An algorithm is presented for constructing parallel circuits between two subcubes so that the tasks of a job can be migrated simultaneously. It is shown that no matter how fragmented the hypercube is, one can always construct parallel paths between two given subcubes. Furthermore, one can always minimize the maximum length of the constructed circuits. A solution that minimizes the maximum length of the circuits will also minimize the total length. The circuits are mutually edgedisjoint and do not use any edge that has been used by other jobs. The time complexity of the algorithm is O(n/sup 2/m), where n is the dimension of the hypercube system and m is the number of jobs already in the system.
[1] G. I. Chen and T. H. Lai, "Virtual subcubes and job migration," Tech. Rep. OSUCISRCTR 5, 1989.
[2] 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.
[3] M. S. Chen and K. G. Shin, "Subcube allocation and task migration in hypercube multiprocessors,"IEEE Trans. Comput., vol. C39, pp. 11461155, 1990.
[4] S. Dutt and J. P. Hayes, "On allocating subcubes in a hypercube multiprocessor," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 801810.
[5] J. P. Hayeset al., "A microprocessorbased hypercube supercomputer,"IEEE Micro, vol. 6, pp. 617, Oct. 1986.
[6] J. Kim, C. R. Das, and W. Lin, "A processor allocation scheme for hypercube computers," inProc. Int. Conf. Parallel Processing, vol. II, 1989, pp. 231238.
[7] S. F. Nugent, "The iPSC/2 DirectConnect communications technology," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 5660.
[8] J. C. Peterson, J. O. Tuazon, D. Lieberman, and M. Pniel, "The Mark III hypercubeensemble concurrent computer," inProc. Int. Conf. Parallel Processing, 1985, pp. 7175.
[9] T. Schwederski, H. J. Siegel, and T. L. Cassavant, "Optimal task migration transfers using multistage cube networks, " inProc. Int. Conf. Parallel Processing, vol. 1, 1990, pp. 5158.