This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An O(log2 N) Depth Asymptotically Nonblocking Self-Routing Permutation Network
August 1995 (vol. 44 no. 8)
pp. 1047-1051

Abstract—A self-routing multi-logN permutation network is presented and studied. This network has 3log2N− 2 depth and $N(\log_2^\gamma N)$(3log2, N− 2)/2 nodes, where N is the number of network inputs and γ a constant very close to 1. A parallel routing algorithm runs in 3log2N− 2 time on this network. The overall system (network and algorithm) can work in pipeline and it is asymptotically nonblocking in the sense that its blocking probability vanishes when N increases, hence the quasi-totality of the information synchronously arrives in 3log2N− 2 steps at the network outputs. This network presents very good fault tolerance, a modular architecture, and it is suitable for information exchange in very large scale parallel processors and communication systems.

[1] K.E. Batcher,“Sorting networks and their application,” Proc. Spring Joint Computer Conf., pp. 307-314, 1968.
[2] G.A. De Biase,C. Ferrone,, and A. Massini,“A quasi-nonblocking self-routing network which routes packetsin log2N time,” Proc. IEEE INFOCOM 93, pp. 1,375-1,381, 1993.
[3] R L. Cruz,“The statistical data fork: A class of broad-band multichannel switches,” IEEE Trans. Communications, vol. 40, pp. 1,625-1,634, 1992
[4] D.V. Huntsberger,Statistical Inference.Boston: Allyn and Bacon Inc., 1967.
[5] D.M. Koppelman and A.Y. Oruç, “A Self-Routing Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 10, pp. 140-151, Oct. 1990.
[6] C.T. Lea,“Bipartite graph design principle for photonic switching systems,” IEEE Trans. Communications, vol. 38, pp. 529-538, 1990.
[7] C.T. Lea,“Multi-log2N networks and their applications inhigh speed electronic and photonic switching systems,” IEEE Trans. Communications, vol. 38, pp. 1,740-1,749, 1990.
[8] C.T. Lea and D.J. Shyy,“Tradeoff of horizontal decomposition versus vertical stackingin rearrangeable nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 899-904, 1991.
[9] R. Melen,“A general class of rearrangeable interconnection networks,” IEEE Trans. Communications, vol. 39, pp. 1,737-1,739, 1991.
[10] D.J. Shyy and C.T. Lea,“Log2(N,m,p) strictly nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 1,502-1,510, 1991.
[11] T.H. Szymansky and V.C. Hamacher,“On the permutation capability of multistage interconnection networks,” IEEE Trans. Computers, vol. 36, pp. 810-822, 1987.
[12] T.H. Szymansky and V.C. Hamacher,“On the universality of multipath multistageinterconnection networks,” J. Parallel and Distributed Computing, vol. 7, pp. 541-569, 1989.

Index Terms:
Permutation networks, self-routing algorithm, blocking probability, stack of banyan networks.
Citation:
C. Ferrone, G.a. De Biase, A. Massini, "An O(log2 N) Depth Asymptotically Nonblocking Self-Routing Permutation Network," IEEE Transactions on Computers, vol. 44, no. 8, pp. 1047-1051, Aug. 1995, doi:10.1109/12.403721
Usage of this product signifies your acceptance of the Terms of Use.