This Article 
 Bibliographic References 
 Add to: 
Constructing Parallel Paths Between Two Subcubes
January 1992 (vol. 41 no. 1)
pp. 118-123

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 circuit-switching 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 edge-disjoint 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. OSU-CISRC-TR 5, 1989.
[2] 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.
[3] M. S. Chen and K. G. Shin, "Subcube allocation and task migration in hypercube multiprocessors,"IEEE Trans. Comput., vol. C-39, pp. 1146-1155, 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. 801-810.
[5] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, 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. 231-238.
[7] S. F. Nugent, "The iPSC/2 Direct-Connect communications technology," inProc. Third Conf. Hypercube Comput. Appl., Pasadena, CA, Jan. 1988, pp. 56-60.
[8] J. C. Peterson, J. O. Tuazon, D. Lieberman, and M. Pniel, "The Mark III hypercube-ensemble concurrent computer," inProc. Int. Conf. Parallel Processing, 1985, pp. 71-75.
[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. 51-58.

Index Terms:
parallel paths; subcubes; hypercube system; circuit-switching hypercube network; parallel circuits; edge-disjoint; time complexity; computational complexity; hypercube networks.
G.-I. Chen, T.-H. Lai, "Constructing Parallel Paths Between Two Subcubes," IEEE Transactions on Computers, vol. 41, no. 1, pp. 118-123, Jan. 1992, doi:10.1109/12.123387
Usage of this product signifies your acceptance of the Terms of Use.