The Community for Technology Leaders
Green Image
Issue No. 04 - April (1982 vol. 31)
ISSN: 0018-9340
pp: 338-341
D. Nassimi , Department of Electrical Engineering and Computer Science, Northwestern University
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.
complexity, BPC permutation, cube connected SIMD computer

D. Nassimi and S. Sahni, "Optimal BPC Permutations on a Cube Connected SIMD Computer," in IEEE Transactions on Computers, vol. 31, no. , pp. 338-341, 1982.
90 ms
(Ver 3.3 (11022016))