Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors

The architecture and performance of binary shuffle-exchange networks of any size are investigated. It is established that a network with a shuffle-exchange stages whose number equals the least integer >or=log/sub 2/N or a single recirculating stage can provide the connectivity between N inputs and N outputs using a distributed tag-based control algorithm. Control tags depend on both source and destination when N is not a power of two and can be computed in a simple manner. Several structural and dynamic properties of the network are established, contrasting the behavior of the power-of-two and composite sized systems. The performance of the network in a stochastic environment is investigated analytically. It is shown that the shuffle-exchange networks behave in much the same way with respect to traffic and buffer capacity regardless of whether the system size is a power of two or not. >

[1]  Miroslaw Malek,et al.  On the Number of Permutations Performable by Extra-Stage Multistage Interconnection Networks , 1989, IEEE Trans. Computers.

[2]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[3]  Pen-Chung Yew,et al.  Performance of packet switching in buffered single-stage shuffle-exchange networks , 1982, ICDCS.

[4]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[5]  Marc Snir,et al.  A Unified Theory of Interconnection Network Structure , 1986, Theor. Comput. Sci..

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

[7]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[8]  Ding-Zhu Du,et al.  Generalized de Bruijn digraphs , 1988, Networks.

[9]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[10]  Pen-Chung Yew,et al.  Stochastic properties of a multiple-layer, single-stage, shuffle-exchange network in a message switching environment (mimd systems) , 1983 .

[11]  Duncan H. Lawrie,et al.  A Class of Redundant Path Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[12]  Duncan Hamish Lawrie,et al.  Memory-processor connection networks , 1973 .

[13]  I. Vinogradov,et al.  Elements of number theory , 1954 .

[14]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[15]  Tomás Lang,et al.  Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network , 1976, IEEE Transactions on Computers.

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

[17]  Solomon W. Golomb,et al.  Permutations by Cutting and Shuffling , 1961 .

[18]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.