On Self-Routing in Benes and Shuffle-Exchange Networks

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]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[2]  Tuvi Etzion,et al.  An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network , 1986, SIAM J. Comput..

[3]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[4]  Pen-Chung Yew,et al.  An Easily Controlled Network for Frequently Used Permutations , 1981, IEEE Transactions on Computers.

[5]  David Steinberg.  Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network , 1983, IEEE Transactions on Computers.

[6]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[7]  John F. Beetem,et al.  The GF11 supercomputer , 1985, ISCA '85.

[8]  Cauligi S. Raghavendra,et al.  Rearrangeability of multistage shuffle/exchange networks , 1988, IEEE Trans. Commun..

[9]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[10]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[11]  W. Greub.  Linear Algebra , 1981 .

[12]  David Nassimi.  A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks , 1989, ICPP.

[13]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[14]  Cauligi S. Raghavendra,et al.  Generalized Schemes for Access and Alignment of Data in Parallel Processors with Self-Routing Interconnection Networks , 1991, J. Parallel Distributed Comput..

[15]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[16]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.