Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
Equivalence of multistage interconnection networks
Information Processing Letters
On a Class of Rearrangeable Networks
IEEE Transactions on Computers
A New Routing Algorithm for a Class of Rearrangeable Networks
IEEE Transactions on Computers
On the Correctness of Inside-Out Routing Algorithm
IEEE Transactions on Computers
Journal of the ACM (JACM)
Algebraic switching theory and broadband applications
Algebraic switching theory and broadband applications
Rearrangeability of $(2\protectn-1)$-Stage Shuffle-Exchange Networks
SIAM Journal on Computing
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
A Routing Algorithm for Modified Omega+Omega Interconnection Networks
PI '99 Proceedings of the The 6th International Conference on Parallel Interconnects
Routing Permutations on Baseline Networks with Node-Disjoint Paths
IEEE Transactions on Parallel and Distributed Systems
Rearrangeability of Tandem Cascade of Banyan-Type Networks
IEICE - Transactions on Information and Systems
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
On the Rearrangeability of 2(Iog2N) -1 Stage Permutation Networks
IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
The Reverse-Exchange Interconnection Network
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
A Survey of Interconnection Networks
Computer
| Hi-index | 0.00 |
A multistage interconnection network (MIN) consisting of 2 × 2 nodes constructs a nonblocking switch if the network is rearrangeable. When a 2n × 2n bit-permuting network is rearrangeable with the minimum depth of 2n - 1, the initial (resp. final) n stages of the network form a banyan-type network and hence the network is equivalent to the tandem connection between two banyan-type networks. Let γ denote the guide permutation of a 2n × 2n banyan-type network and τ the trace permutation of another. These are permutations on numbers from 1 to n. This paper proves that, when the permutation γτ-1 is the transposition between the number n and some number k n, the tandem connection between the two networks is rearrangeable. This sufficient condition for rearrangeability covers a wide class of tandem connections. For example, the first network in tandem can be the omega network appended with the banyan exchange of any rank while the second is the reversed omega network.