Journal of the ACM (JACM)
An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
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
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines
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
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Reduced distance routing in single-state shuffle-exchange interconnection networks
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Rearrangeability of multistage shuffle/exchange networks
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
IEEE Transactions on Computers
Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps
IEEE Transactions on Computers
Notes on Shuffle/Exchange Type Permutation Sets
IEEE Transactions on Computers
IEEE Transactions on Computers
On a Class of Rearrangeable Networks
IEEE Transactions on Computers
Hierarchical Classification of Permutation Classes in Multistage Interconnection Networks
IEEE Transactions on Computers
Performing Permutations on Interconnection Networks by Regularly Changing Switch States
IEEE Transactions on Parallel and Distributed Systems
Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags
IEEE Transactions on Computers
Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Routing Permutations on Baseline Networks with Node-Disjoint Paths
IEEE Transactions on Parallel and Distributed Systems
On the Rearrangeability of Reverse Shuffle/Exchange Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
On rearrangeability of tandem connection of banyan-type networks
IEEE Transactions on Communications
| Hi-index | 15.01 |
In this paper, we present a new model, finite permutation machine (FPM), to describe the permutation networks. A set of theorems are developed to capture the theory of operations for the permutation networks. Using this new framework, an interesting problem is attacked: are 2n - 1 passes of shuffle exchange necessary and sufficient to realize all permutations? where n = log2 N and N is the number of inputs and outputs interconnected by the network. We prove that to realize all permutations, 2n - 1 passes of shuffle exchange are necessary and that 3n - 3 passes are sufficient. This reduces the sufficient number of passes by 2 from the best-known result.