Uniform theory of the shuffle-exchange type permutation networks
- 13 June 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 11 (3) , 185-191
- https://doi.org/10.1145/1067651.801655
Abstract
This paper presents the uniform theory for describing of the shuffle-exchange type permutation networks - the theory of E k stages. The use of this new approach is demonstrated by applying it to the flip, omega, and other incomplete permutation networks and to some complete networks /e.g. the Beneš network/ as well. Especially the paper deals with the p, 2p, and /2p=1/-stage networks, where p = log 2 n and n is number of the inputs /or outputs/ of these networks.Keywords
This publication has 9 references indexed in Scilit:
- Uniform theory of the shuffle-exchange type permutation networksPublished by Association for Computing Machinery (ACM) ,1983
- Performance of Processor-Memory Interconnections for MultiprocessorsIEEE Transactions on Computers, 1981
- A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD MachinesIEEE Transactions on Computers, 1980
- Notes on Shuffle/Exchange-Type Switching NetworksIEEE Transactions on Computers, 1980
- Interconnection Networks for SIMD MachinesComputer, 1979
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1976
- Banyan networks for partitioning multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1973
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971