The Community for Technology Leaders
Green Image
<p>A self-routing permutation network with O((n lg n)) switches and O(lg/sup 2/n) routing time, where lg denotes log/sub 2/, is presented. More generally, a permutation network with O(kn/sup 1+1/k/) cost and O(k lg n) routing time for any k, 1>or=k lg n, is described. This improves D. Nassimi and J. Sahni's (1982) routing algorithm that gives O(k lg/sup 3/ n) routing time for the same cost expression. The only networks capable of permutation switching with O(n lg n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing network, but the constants hidden in the complexities of these networks are so large that they remain impractical until n gets very large.</p>
computational complexity; multiprocessor interconnection networks; packet switching; self-routing permutation switching; asymptotically minimum cost network; cost expression; AKS sorting network; packet routing network; complexities.
A.Y. Oruc, Ching Yuh Jan, "Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network", IEEE Transactions on Computers, vol. 42, no. , pp. 1469-1479, December 1993, doi:10.1109/12.260636
96 ms
(Ver 3.3 (11022016))