This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Feb. 1981 (vol. 30 no. 2)
pp. 93-100
Gavriela Freund Lev, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland
Nicholas Pippenger, IBM Research, San Jose, CA 95193
Leslie G. Valiant, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland
An algorithm is given for routing in permutation networks — that is, for computing the switch settings that implement a given permutation. The algorithm takes serial time O(n(log n)2) (for one processor with random access to a memory of O(n) words) or parallel time O((log n)3) (for n synchronous processors with conflict-free random access to a common memory of O(n) words). These time bounds may be reduced by a further logarithmic factor when all of the switch sizes are integral powers of two.
Index Terms:
routing algorithm,Complexity,interconnection networks,parallel processing,permutation networks,randomization
Citation:
Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant, "A fast parallel algorithm for routing in permutation networks," IEEE Transactions on Computers, vol. 30, no. 2, pp. 93-100, Feb. 1981, doi:10.1109/TC.1981.6312171
Usage of this product signifies your acceptance of the Terms of Use.