Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
The connection machine
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
A VLSI decomposition of the deBruijn graph
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient VLSI Layouts for Homogeneous Product Networks
IEEE Transactions on Computers
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Hyper-Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
Information Processing Letters
On two-layer brain-inspired hierarchical topologies – a rent's rule approach –
Transactions on High-Performance Embedded Architectures and Compilers IV
| Hi-index | 0.01 |
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.