The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1982 vol.31)
pp: 338-341
D. Nassimi , Department of Electrical Engineering and Computer Science, Northwestern University
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.
INDEX TERMS
complexity, BPC permutation, cube connected SIMD computer
CITATION
D. Nassimi, S. Sahni, "Optimal BPC Permutations on a Cube Connected SIMD Computer", IEEE Transactions on Computers, vol.31, no. 4, pp. 338-341, April 1982, doi:10.1109/TC.1982.1676004
63 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool