This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal BPC Permutations on a Cube Connected SIMD Computer
April 1982 (vol. 31 no. 4)
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.
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
Usage of this product signifies your acceptance of the Terms of Use.