Self-routing technique in perfect-shuffle networks using control tags
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (2) , 251-256
- https://doi.org/10.1109/12.2159
Abstract
[[abstract]]The self-routing technique using control tags on multiple-pass perfect-shuffle networks is generalized. In particular, they show that bit-permute-complement permutations can be realized and unscrambled in (2n-1) passes or less, where n=log2N, N being the number of terminals on either side. They also show that most of the frequently used permutations are in the intersection of omega-realizing and inverse-omega-realizing sets and can be realized and unscrambled in n passes[[fileno]]2030249010002[[department]]資訊工程學This publication has 14 references indexed in Scilit:
- Permuting data with the Omega networkActa Informatica, 1985
- Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega NetworkIEEE Transactions on Computers, 1983
- A Unified Approach to a Class of Data Movements on an Array ProcessorIEEE Transactions on Computers, 1982
- The Universality of the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1981
- A Self-Routing Benes Network and Parallel Permutation AlgorithmsIEEE Transactions on Computers, 1981
- An Easily Controlled Network for Frequently Used PermutationsIEEE Transactions on Computers, 1981
- The Theory Underlying the Partitioning of Permutation NetworksIEEE Transactions on Computers, 1980
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971