Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Data Broadcasting And Reduction, Prefix Computation, And Sorting On Reduced Hypercube (Rh) Parallel Computers, Arup Mukherjee
Data Broadcasting And Reduction, Prefix Computation, And Sorting On Reduced Hypercube (Rh) Parallel Computers, Arup Mukherjee
Theses
The binary hypercube parallel computer has been very popular due to its rich interconnection structure and small average internode distance which allow the efficient embedding of frequently used topologies. Communication patterns of many parallel algorithms also match the hypercube topology. The hypercube has high VLSI complexity. however. due to the logarithmic increase in the number of connections to each node with the increase in the number of dimensions of the hypercube. The reduced hypercube (RH) interconnection network. which is obtained by a uniform reduction in the number of links for each hypercube node. yields lower-complexity interconnection networks when compared to …
Investigation Of Reduced Hypercube (Rh) Networks : Embedding And Routing Capabilities, Michalis A. Sideras
Investigation Of Reduced Hypercube (Rh) Networks : Embedding And Routing Capabilities, Michalis A. Sideras
Theses
The choice of a topology for the interconnection of resources in a distributed-memory parallel computing system is a major design decision. The direct binary hypercube has been widely used for this purpose due to its low diameter and its ability to efficiently emulate other important structures. The aforementioned strong properties of the hypercube come at the cost of high VLSI complexity due to the increase in the number of communication ports and channels per node with an increase in the total number of nodes. The reduced hypercube (RH) topology, which is obtained by a uniform reduction in the number of …