On a Class of Rearrangeable Networks

Benes networks are nonblocking rearrangeable networks that can realize arbitrary permutations without conflict. A class of 2 log/sub b/ N stage networks which are equivalent to the Benes networks is introduced. Networks in this class can be either symmetric or asymmetric in their structure, regular or irregular in their interstage connections, and even, 2 log/sub b/ N or 2 log/sub b/ N-1 stages. All networks in this class are nonblocking rearrangeable. A switch labeling scheme is proposed to provide testing of the topological and functional equivalency for this class of networks. This switch labeling scheme can also provide a novel matrix representation for network configuration. This representation introduces a portability concept for the routing scheme on this class of networks. With this representation, a general routing scheme is also developed. This routing scheme can realize arbitrary permutation for the whole class of 2 log/sub b/ N stage networks. >

[1]  Yao-Ming Yeh.  Fault tolerance and generalization on a class of multistage interconnection networks , 1992 .

[2]  S. Andresen.  The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks , 1977, IEEE Trans. Commun..

[3]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

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

[5]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part II: Enumeration studies and fault diagnosis , 1971 .

[6]  Kyungsook Y. Lee,et al.  A New Benes Network Control Algorithm , 1987, IEEE Trans. Computers.

[7]  Kyungsook Y. Lee.  On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

[8]  Shing-Tsaan Huang,et al.  Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks , 1986, IEEE Transactions on Computers.

[9]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[10]  V. Benes.  On rearrangeable three-stage connecting networks , 1962 .

[11]  Tse-Yun Feng,et al.  The Reverse-Exchange Interconnection Network , 1980, IEEE Trans. Computers.

[12]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[13]  Dhiraj K. Pradhan,et al.  A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines , 1980, IEEE Transactions on Computers.

[14]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[15]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[16]  Dharma P. Agrawal,et al.  Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[17]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[18]  Dharma P. Agrawal,et al.  Design and Performance of Generalized Interconnection Networks , 1983, IEEE Transactions on Computers.

[19]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

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