On rearrangeable networks of the shuffle-exchange type
Computers and Artificial Intelligence
Interpolation between bases and the shuffle exchange network
European Journal of Combinatorics
The Mathematical Theory of Nonblocking Switching Networks
The Mathematical Theory of Nonblocking Switching Networks
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
The Universality of the Shuffle-Exchange 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
Analyzing permutation capability of multistage interconnection networks with colored Petri nets
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper, the rearrangeability of (2s-1)-stage networks is proved. This result is used to prove that (2 logn N-1)-stage nonsymmetric networks employing uniform connection pattern, two passes through s-stage networks with the same kth and (s-k+1)st stages, and 2 lognN-1 circulations through single-stage networks are rearrangeable.