Hierarchical shuffle-exchange and de Bruijn networks

The authors present two new classes of interconnection networks for SIMD (single-instruction multiple-data) computers, namely, the hierarchical shuffle-exchange (HSE) and hierarchical de Bruijn (HdB) networks. These networks are efficient in implementing a wide range of algorithms, including all of those in the classes ascend and descend. The networks are highly regular and scalable, and well-suited to VLSI implementation. In addition, they can be adjusted to match the pin limitations imposed by the packaging technology. The authors compare the HSE and HdB networks with hypercube, 2-D mesh, 3-D mesh, shuffle-exchange, hypernet, de Bruijn, and cube-connected cycles networks. The HSE and HdB networks are shown to have advantages in terms of regularity, scalability, and performance