This Article 
 Bibliographic References 
 Add to: 
A Fast and Low Cost Self-Routing Permutation Network
September 1998 (vol. 47 no. 9)
pp. 1033-1036

Abstract—In this paper, we present a new implementation of the fast VLSI-efficient self-routing N × N permutation network proposed by Cam and Fortes, which requires only about half as much hardware and has a lower latency. Cam and Fortes' implementation uses Cormen and Leiserson's hyperconcentrators, which can route only active inputs. The reduction in hardware is achieved by modifying Cormen and Leiserson's hyperconcentrator to route active, as well as inactive, inputs to the output. This modification allows us to reduce the number of hyperconcentrators needed in the permutation network by 50 percent and eliminate the interstage interconnection networks, making the permutation network faster by log2N bits.

[1] H. Cam and J.A.B. Fortes, "A Fast VLSI-Efficient Self-Routing Permutation Network," IEEE Trans. Computers, vol. 44, no. 3, pp. 448-453, Mar. 1995.
[2] T.H. Cormen and C.E. Leiserson, "A Hyperconcentrator Switch for Routing Bit-Serial Messages," Proc. 1986 Int'l Conf. Parallel Processing, pp. 721-728, 1986.
[3] K.E. Batcher, "Sorting Networks and Their Applications," Proc. 1968 Spring Joint Computer Conf., pp. 307-314, 1968.
[4] 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.
[5] A. Huang and S. Knauer, "Starlite: A Wideband Digital Switch," Proc. IEEE GLOBECOM '84, pp. 5.3.1-5.3.5, 1984.
[6] F.A. Tobagi, T. Kwok, and F.M. Chiussi, "Architecture, Performance, and Implementation of the Tandem Banyan Fast Packet Switch," IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,173-1,193, 1991.
[7] P.C. Wong and M.S. Yeung, "Design and Analysis of a Novel Fast Packet Switch—Pipeline Banyan," IEEE/ACM Trans. Networking, vol. 3, no. 1, pp. 63-69, 1995.
[8] M.J. Narasimha, "A Recursive Concentrator Structure with Applications to Self-Routing Switching Networks," IEEE Trans. Comm., vol. 42, nos. 2/3/4, pp. 896-898, Feb./Mar./Apr. 1994.
[9] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,469-1,479, Dec. 1993.

Index Terms:
Self-routing, permutation network, concentrator, radix-sorting, VLSI implementation.
Jagan Agrawal, Yixin Zhang, "A Fast and Low Cost Self-Routing Permutation Network," IEEE Transactions on Computers, vol. 47, no. 9, pp. 1033-1036, Sept. 1998, doi:10.1109/12.713324
Usage of this product signifies your acceptance of the Terms of Use.