Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
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
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Fault-Tolerant Multiprocessor Link and Bus Network Architectures
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
A Fault-Tolerant Communication Architecture for Distributed Systems
IEEE Transactions on Computers
| Hi-index | 0.00 |
Hypercube as a parallel interconnection network is of academic and engineering concerns for tens of years due to its many merits. However, its increasing node degree is an obvious weakness. Some networks such as Cube-Connected Circle and DeBruijn Network have been proposed to overcome the increasing degree of hypercube. In this paper, we present a new cost-effective network which outperforms the cube network. It can overcome the increasing degree of cube network while keeping the advantages of cube network such as logarithmic diameter, easy routing, optimal fault tolerance, and suitability for ASCEND/DESCEND class of parallel problems. Furthermore, the proposed network achieves the logarithmic diameter with a very small constant node degree, 3 or 4.