Data Broadcasting and Reduction, Prefix Computation, and Sorting on Reduces Hypercube Parallel Computer

The popular hypercube interconnection network has high wiring(VLS1) complexity. The reduced hypercube (RH) is obtained by a uniform reduction in the number of channels for each hypercube node in order io reduce the VLSI complexity. It is known that the RH achieves performance comparable to that of the hypercube, at much lower hardware cost, through hypercube emulation. The reduced complexity of the RH permits the construction of powerful, massively parallel computers. This paper proposes algorithms for data broadcasting and reduction, prefix computation, and sorting on the RH. These operations are fundamental to many parallel algorithms. A worst case analysis of each algorithm is given and compared with that of equivalent algorithms for the hypercube. It is shown that the proposed algorithms for the RH yield performance comparable to that of the hypercube.

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[3]  Sotirios G. Ziavras.  A class of scalable architectures for high-performance, cost-effective parallel computing , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[4]  Roy M. Jenevein,et al.  Scaleability of a Binary Tree on a Hypercube , 1986, ICPP.

[5]  Sotirios G. Ziavras.  Generalized reduced hypercube interconnection networks for massively parallel computers , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[6]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[7]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[8]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[9]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[10]  Sotirios G. Ziavras,et al.  Pyramid mappings onto hypercubes for computer vision: Connection machine comparative study , 1993, Concurr. Pract. Exp..

[11]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[12]  Fikret Erçal,et al.  Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures , 1997, J. Parallel Distributed Comput..

[13]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[14]  Sotirios G. Ziavras.  On the Problem of Expanding Hypercube-Based Systems , 1992, J. Parallel Distributed Comput..

[15]  Yousef Saad,et al.  Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

[16]  Kanad Ghose,et al.  The HCN: a versatile interconnection network based on cubes , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[17]  Ten-Hwang Lai,et al.  Mapping Pyramid Algorithms into Hypercubes , 1990, J. Parallel Distributed Comput..

[18]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[19]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[20]  Sotirios G. Ziavras.  RH: A Versatile Family of Reduced Hypercube Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[21]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[22]  S. Johnsson,et al.  Spanning balanced trees in Boolean cubes , 1989 .

[23]  Sotirios G. Ziavras,et al.  Facilitating High-Performance Image Analysis on Reduced Hypercube (RH) Parallel Computers , 1995, Int. J. Pattern Recognit. Artif. Intell..

[24]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.