This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Algorithms to Set Up the Benes Permutation Network
February 1982 (vol. 31 no. 2)
pp. 148-154
D. Nassimi, Department of Electrical Engineering and Computer Science, Northwestern University
A parallel algorithm to determine the switch settings for a Benes permutation network is developed. This algorithm can determine the switch settings for an N input/output Benes network in 0(log2N) time when a fully interconnected parallel computer with N processing elements is used. The algorithm runs in 0(N?) time on an N?? N?mesh-connected computer and 0(log
Index Terms:
set-up algorithm, Benes permutation network, complexity, cube connected computer, fully connected SIMD computer, mesh-connected computer, parallel algorithm, perfect shuffle computer
Citation:
D. Nassimi, S. Sahni, "Parallel Algorithms to Set Up the Benes Permutation Network," IEEE Transactions on Computers, vol. 31, no. 2, pp. 148-154, Feb. 1982, doi:10.1109/TC.1982.1675960
Usage of this product signifies your acceptance of the Terms of Use.