About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SPDP 1992
Conference paper
Hierarchical shuffle-exchange and de Bruijn networks
Abstract
We present two new classes of interconnection networks for SIMD computers, namely the hierarchical shuffle-exchange (HSE) and hierarchical de Bruijn (HdB) networks. These new 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 thus well-suited to VLSI implementation. In addition, they can be adjusted to match the pin limitations imposed by the packaging technology. We compare the HSE and HdB networks with hypercube, 2-dimensional mesh, 3-dimensional 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.