This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Interconnection Network for SIMD Computers: The Sigma Network
July 1987 (vol. 36 no. 7)
pp. 794-801
A. Seznec, IRISA
When processing vectors on SIMD computers, some data manipulations (rearrangement, expansion, compression, perfect-shuffle, bit-reversal) have to be performed by an interconnection network. When this network lacks an efficient routing control, it becomes the bottleneck for performance. It has been pointed out that general algorithms to control rearrangeable networks for arbitrary permutations are time consuming. To overcome this difficulty, Lenfant [9] proposed a set of permutations covering standard needs associated with efficient control algorithms for the Benes network. But to perform explicit permutations on vectors, several passes through the network are necessary because they have to be composed with transfer rearrangements. We present efficient control algorithms to perform these vector permutations in a single pass on a new interconnection network.
Index Terms:
vector processing, BPC (bit permute complement permutation), compression, expansion, Omega network, reverse Omega network, Sigma network, SIMD computer
Citation:
A. Seznec, "A New Interconnection Network for SIMD Computers: The Sigma Network," IEEE Transactions on Computers, vol. 36, no. 7, pp. 794-801, July 1987, doi:10.1109/TC.1987.1676976
Usage of this product signifies your acceptance of the Terms of Use.