This Article 
 Bibliographic References 
 Add to: 
New Self-Routing Permutation Networks
November 1994 (vol. 43 no. 11)
pp. 1319-1323

This contribution is focused on self-routing permutation networks capable of routing all n! permutations of its n inputs to its n outputs without internal conflict. First, a self-routing permutation network named BNB SRPN is described. The network realizes the self-routing capability on the structure of the generalized baseline network, a modified model of the original baseline network. The network reduced both the hardware and the delay time compared with other comparable networks by a simple algorithm using 1-bit information for the routing decision. The network also has a good hardware regularity. In addition, a cost-effective self-routing network is presented, which is derived from the BNB SRPN. The network's hardware complexity, O(N log N), is the same as that of the Benes network which is not self-routing. The principle realizing a modular structure is also presented. The modular structure is derived from the principle to localize the routing decision. It is shown that the modular structure results in the reduction of the total delay through the network.

[1] T. Feng, "A survey of interconnection networks," inIEEE Computer, pp. 12-27, Dec. 1981.
[2] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[3] W. H. Kautz, K. N. Levitt, and A. Waksman, "Cellular interconnection arrays."IEEE Trans. Comput., vol. C-17, pp. 443-451, May 1968.
[4] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.
[5] D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network,"IEEE Trans. Comput., vol. C-31, pp. 148-154, 1982.
[6] K. E. Batcher, "Sorting networks and their applications," inProc. 1968 Spring Joint Comput. Conf., vol. 32, AFIPS, Montvale, NJ, pp. 307-314.
[7] D. Koppelman and A. Oruç, "A self-routing permutation network," inProc. 1989 Int. Conf. on Parallel Processing, 1989, vol. I, pp. 288-295.
[8] S. Lee and M. Lu, "BNB self-routing permutation network," inProc. 1991 Int. Conf. Distrib. Computing Syst., May 1991, pp. 574-581.
[9] K. E. Batcher, "The flip network in Staran," inProc. 1976 Int. Conf. Parallel Processing, 1976, pp. 65-71.
[10] C. L. Wu and T. Feng, "On a class of multistage interconnection networks."IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[11] H. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, Feb. 1971.
[12] C. Wu and T. Feng, "The universality of the shuffle-exchange network,"IEEE Trans. Comput., vol. C-30, no. 5, pp. 324-332, May 1981.
[13] S. Lee, "Self-routing permutation networks for communications and computer systems," Ph.D. dissertation, Texas A&M Univ., 1991.

Index Terms:
network routing; switching networks; multiprocessor interconnection networks; computational complexity; self-adjusting systems; self-routing permutation networks; BNB SRPN; generalized baseline network; delay time; routing decision; hardware complexity; Benes network .
S. Lee, M. Lu, "New Self-Routing Permutation Networks," IEEE Transactions on Computers, vol. 43, no. 11, pp. 1319-1323, Nov. 1994, doi:10.1109/12.324564
Usage of this product signifies your acceptance of the Terms of Use.