Rearrangeability of multistage shuffle/exchange networks
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (10), 1138-1147
- https://doi.org/10.1109/26.7531
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8IEEE Transactions on Communications, 1987
- Finite State Model and Compatibility Theory: New Analysis Tools for Permutation NetworksIEEE Transactions on Computers, 1986
- Uniform theory of the shuffle-exchange type permutation networksACM SIGARCH Computer Architecture News, 1983
- Interconnection Networks Using ShufflesComputer, 1981
- The Universality of the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1981
- A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD MachinesIEEE Transactions on Computers, 1980
- The universality of various types of SIMD machine interconnection networksPublished by Association for Computing Machinery (ACM) ,1977
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- A Permutation NetworkJournal of the ACM, 1968