Issue No. 09 - September (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.243525
<p>Both Hypercube and deBruijn networks possess desirable properties. It should beunderstood, though, that some of the attractive features of one are not found in theother. The architecture proposed in this paper is a combination of these architectures,providing some of the desirable properties of both the networks such as admitting manycomputationally important networks, flexibility in terms of connections per node as well as level of fault-tolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimalconnectivity, and simple routing algorithms amendable to networks with faults.Importantly, in addition to being pancyclic, these hyper-deBruijn networks admit mostcomputationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation. Techniques for optimal one-to-all (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable.</p>
Index Termshyper-deBruijn networks; scalable versatile architecture; fault-tolerance; VLSI layout;decomposability; multiprocessor networks; logarithmic diameter; optimal connectivity;routing algorithms; multidimensional meshes; complete binary trees; optimal one-to-allbroadcasting; fault tolerant computing; hypercube networks; parallel architectures
E. Ganesan and D. Pradhan, "The Hyper-deBruijn Networks: Scalable Versatile Architecture," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 962-978, 1993.