This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps
February 1991 (vol. 40 no. 2)
pp. 217-221

Optimal setup procedures for cube-connected networks are described. The setup patterns include paths, transpositions, cycles, and one-pass permutations. It is shown that for an N-input cube-connected network, the procedure for paths requires O(log/sub 2/ N) steps and O(N) space, the procedure for transportations and cycles requires O(N) steps and O(N) space, and the procedure for permutations takes O(N log/sub 2/ N) steps and O(N) space. It is also shown that the time complexities of the setup procedures for transpositions, cycles, and permutations can be improved as O(log/sub 2/ N) by using O(N) processors.

[1] L. N. Bhuyan and D. P. Agrawal, "Design and performance of generalized interconnection networks,"IEEE Trans. Comput., vol. C-32, no. 12, pp. 1081-1090, Dec. 1983.
[2] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C-33, no. 4, pp. 323-333, Apr. 1983.
[3] T. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, no. 12, pp. 12-17, Dec. 1981.
[4] J. P. Hayeset al., "A microprocessor-based hypercube supercomputer,"IEEE Micro, vol. 6, pp. 6-17, Oct. 1986.
[5] S.-T. Huang and S. K. Tripathi, "Finite state model and compatibility theory: New analysis tools for permutation networks,"IEEE Trans. Comput., vol. C-35, no. 7, pp. 591-601, July 1986.
[6] M. Karnaugh, "The map method for synthesis of combinational logic circuits,"AIEE Trans., vol. 72, no. 9, pp. 593-599, Sept. 1953.
[7] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, no. 12, pp. 1145-1155, Dec. 1975.
[8] K. Y. Lee, "On the rearrangeability of 2(log2N) - 1 stage permutation networks,"IEEE Trans. Comput., vol. C-34, no. 5, pp. 412-425, May 1985.
[9] A. Y. Oruçand M. Mittal, "New algorithms for realizing paths and permutations through cube-connected networks," inProc. ACM Comput. Sci. Conf., Cincinnati, OH, Feb. 1986, pp. 137-146.
[10] J. H. Patel, "Performance of processor-memory interconnections for muItiprocessors,"IEEE Trans. Comput., vol. C-30, no. 10, pp. 771-780, Oct. 1981.
[11] M. C. Pease, "The indirect binaryN-cube multiprocessor array,"IEEE Trans. Comput., vol. C-26, no. 5, pp. 458-473, May 1977.
[12] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[13] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[14] D. Steinberg, "Invariant properties of the shuffle-exchange and simplified cost-effective version of the omega network,"IEEE Trans. Comput., vol. C-32, no. 5, pp. 444-450, May 1983.
[15] C.-L. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, no. 8, pp. 694-702, Aug. 1980.
[16] C.-L. Wu and T. Feng, "The reverse-exchange interconnection network,"IEEE Trans. comput., vol. C-29, no. 9, pp. 801-810, Sept. 1980.

Index Terms:
setup algorithms; cube-connected parallel computers; recursive Karnaugh maps; paths; transpositions; cycles; one-pass permutations; transportations; cycles; time complexities; computational complexity; parallel algorithms.
Citation:
A.Y. Sips, M. Lin, "Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps," IEEE Transactions on Computers, vol. 40, no. 2, pp. 217-221, Feb. 1991, doi:10.1109/12.73592
Usage of this product signifies your acceptance of the Terms of Use.