Issue No. 02 - April (1990 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.80144
<p>The authors introduce a family of networks that are a synthesis of banyans and hypercubes and are called the banyan-hypercubes (BH). They combine the advantageous features of banyans and hypercubes and thus have better communication capabilities.The networks can be viewed as consisting of interconnecting hypercubes. It is shown that many hypercube features can be incorporated into BHs with regard to routing, embedding of rings and meshes, and partitioning, and that improvements over the hypercube result are made. In particular, it is shown that BHs have better diameters and average distances than hypercubes, and they embed pyramids and multiple pyramids with dilation cost 1. An optimal routing algorithm for BHs and an efficient partitioning strategy are presented.</p>
Index Termsbanyan-hypercube networks; communication capabilities; interconnecting hypercubes; routing; embedding of rings; partitioning; optimal routing algorithm; partitioning strategy; multiprocessor interconnection networks; parallel architectures; performance evaluation
A. Youssef and B. Narahari, "The Banyan-Hypercube Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 160-169, 1990.