Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
On permutations passable by the Gamma network
Journal of Parallel and Distributed Computing
A fault-tolerant scheme for multistage interconnection networks
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
3-disjoint gamma interconnection networks
Journal of Systems and Software
Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving
The Journal of Supercomputing
Combined space and time analysis of Banyan networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
The Journal of Supercomputing
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
A new multipath multistage interconnection network called the composite banyan network is proposed. The network incorporates both the banyan and the reverse banyan networks and is constructed by superimposing the two. The basic building blocks in the composite banyan network are 3 脳 3 switching elements with log2N stages. A major advantage of the composite banyan network over existing networks with 3 脳 3 SEs is an efficient and fast control algorithm that sets up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. Also, the network has a lot of favorable features, including regularity, symmetry, and easy rerouting capability under faults and conflicts. It is shown that at least two totally disjoint paths exist between any source and destination pair, which increase the degree of fault-tolerance. A deterministic permutation routing algorithm is also developed for the 8 脳 8 composite banyan network. Using a simple tabular method, it is shown that the algorithm always finds a set of conflict-free tags.