Issue No. 02 - Feb. (1981 vol. 30)
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.
routing algorithm, Complexity, interconnection networks, parallel processing, permutation networks, randomization
G. F. Lev, N. Pippenger and L. G. Valiant, "A fast parallel algorithm for routing in permutation networks," in IEEE Transactions on Computers, vol. 30, no. , pp. 93-100, 1981.