The hyper-deBruijn multiprocessor networks
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Hypercube and deBruijn networks each possess certain desirable properties. The architecture proposed is a combination of the hypercube and deBruijn architectures. Thus, it provides flexibility in terms of connections per node and the level of fault-tolerance. The graph structure allows a direct decomposition of the network into VLSI building blocks. These networks possess logarithmic diameter, optimal connectivity and simple routing algorithms amenable to networks with faults. These hyper-deBruijn networks admit many computationally important subnetworks such as rings, multidimensional meshes, complete binary trees and mesh of trees with perfect dilation, in addition to being pancyclic Author(s) Ganesan, E. Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA Pradhan, D.K.Keywords
This publication has 10 references indexed in Scilit:
- A combinatorial problem on Trapezoidal wordsTheoretical Computer Science, 2002
- The banyan-hypercube networksIEEE Transactions on Parallel and Distributed Systems, 1990
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSIIEEE Transactions on Computers, 1989
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- Embedding of tree networks into hypercubesJournal of Parallel and Distributed Computing, 1985
- The cosmic cubeCommunications of the ACM, 1985
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal TreesIEEE Transactions on Computers, 1983
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Distributed fault-tolerance for large multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1980