Issue No. 02 - Feb. (1981 vol. 30)

ISSN: 0018-9340

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

ABSTRACT

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

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.

doi:10.1109/TC.1981.6312171

CITATIONS