This Article 
 Bibliographic References 
 Add to: 
On Self-Routing in Benes and Shuffle-Exchange Networks
September 1991 (vol. 40 no. 9)
pp. 1057-1064

The authors present self-routing algorithms for realizing the class of linear permutations in various multistage networks such as Benes and 2n-stage shuffle-exchange. Linear permutations are useful in providing fast access of data arrays. In the first half of the network, switches are set by comparing the destination tags at their inputs, and, in the second half, switches are set using the Omega self-routing algorithm. It is shown that the comparison operations can be implemented in bit-serial networks without loss of time. In contrast, with the well-known Benes network self-routing algorithm of D. Nassimi and S. Sahni (1981), switches are set by giving priority to the destination tag at the upper input to them. The algorithms presented are useful in providing fast access of various data patterns using interconnection networks cheaper than crossbars.

[1] J. Beetem, M. Denneau, and D. Weingarten, "The GF11 supercomputer," inProc. Int. Symp. Comput. Architecture, 1985, pp. 108-115.
[2] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[3] G. Birhkoff and S. MacLane,A Survey of Modern Algebra, fourth ed. New York: Macmillan, 1977.
[4] R. V. Boppana and C. S. Raghavendra, "Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks,"J. Parallel Distributed Comput., vol. 11, pp. 97-111, 1991.
[5] T. Etzion and A. Lempel, "An efficient algorithm for generating linear transformations in a shuffle-exchange network,"SIAM J. Comput., vol. 15, no. 1, pp. 216-221, Feb. 1986.
[6] K. Hoffman and R. Kunze,Linear Algebra, second ed. Englewood Cliffs, NJ: Prentice-Hall, 1971.
[7] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, no. 12, 1975.
[8] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C-27, 1978.
[9] D. Nassimi, "A fault-tolerant routing algorithm for BPC permutations on multistage interconnection networks, " inProc. Int. Conf. Parallel Processing, 1989, pp. 278-287.
[10] D. Nassimi and S. Sahni, "A self-routing Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C-30, no. 5, 1981.
[11] D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network,"IEEE Trans. Comput., vol. C-31, pp. 148-154, 1982.
[12] D. S. Parker, "Notes on shuffle/exchange-type switching networks,"IEEE Trans. Comput., vol. C-29, pp. 213-222, 1980.
[13] M.C. Pease, III, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, 1977.
[14] C. S. Raghavendra and R. V. Boppana, "An analysis of some self-routing schemes for multi-stage interconnection networks," Tech. Rep., Dep. EE-Systems, Univ. of Southern Cal., Univ. Park, Los Angeles, CA 90089-0781, June 1990.
[15] D. Steinberg, "Invariant properties of the shuffle-exchange and a simplified cost-effective version of the omega network,"IEEE Trans. Comput., vol. C-32, pp. 444-450, 1983.
[16] A. Varma and C. S. Raghavendra, "Rearrangeability of multistage shuffle/exchange networks,"IEEE Trans. Commun., vol. COM-36, no. 10, 1988.
[17] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.
[18] P.-C. Yew and D. H. Lawrie, "An easily controlled network for frequently used permutations,"IEEE Trans. Comput., vol. C-30, no. 4, 1981.

Index Terms:
Benes networks; shuffle-exchange networks; self-routing algorithms; network self-routing; interconnection networks; multiprocessor interconnection networks.
C.S. Raghavendra, R.V. Boppana, "On Self-Routing in Benes and Shuffle-Exchange Networks," IEEE Transactions on Computers, vol. 40, no. 9, pp. 1057-1064, Sept. 1991, doi:10.1109/12.83649
Usage of this product signifies your acceptance of the Terms of Use.