Optimal BPC Permutations on a Cube Connected SIMD Computer
- 1 April 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (4) , 338-341
- https://doi.org/10.1109/tc.1982.1676004
Abstract
In this correspondence we develop an algorithm to perform BPC permutations on a cube connected SIMD computer. The class of BPC permutations includes many of the frequently occurring permutations such as matrix transpose, vector reversal, bit shuffle, and perfect shuffle. Our algorithm is shown to be optimal in the sense that it uses the fewest possible number of unit routes to accomplish any BPC permutation.Keywords
This publication has 7 references indexed in Scilit:
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982
- A Self-Routing Benes Network and Parallel Permutation AlgorithmsIEEE Transactions on Computers, 1981
- Architecture of a massively parallel processorPublished by Association for Computing Machinery (ACM) ,1980
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- A Model of SIMD Machines and a Comparison of Various Interconnection NetworksIEEE Transactions on Computers, 1979
- Interconnection Networks for SIMD MachinesComputer, 1979
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975