This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Self-Routing Benes Network and Parallel Permutation Algorithms
May 1981 (vol. 30 no. 5)
pp. 332-340
D. Nassimi, Department of Electrical Engineering and Computer Science, Northwestern University
A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for the N input utput self-routing network is O(log N). It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connected and perfect shuffle computers.
Index Terms:
perfect shuffle computer, Benes network, bit-permute-complement permutations, complexity, cube connected computer, inverse omega perputations, omega permutations
Citation:
D. Nassimi, S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms," IEEE Transactions on Computers, vol. 30, no. 5, pp. 332-340, May 1981, doi:10.1109/TC.1981.1675791
Usage of this product signifies your acceptance of the Terms of Use.