A Parallel Algorithms for Traffic Control Problems in Three-Stage Connecting Networks

A parallel heuristic algorithm for traffic control problems in three-stage connecting networks is presented in this paper. A three-stage connecting network consists of an input crossbar switching stage, an intermediate crossbar switching stage, and an output crossbar switching stage. The goal of our algorithm is to quickly and efficiently find a conflict-free switching assignment for communication demands through the network. The algorithm requires n2 × m processing elements for the network composed of n input/output switches and m intermediate switches, where it runs not only on a sequential machine, but also on a parallel machine with maximally n2 × m processors. The algorithm was verified by 1100 simulation runs with the network size from 102 × 7 to 502 × 27. The simulation results show that the algorithm can find a solution in nearly constant time with n2 × m processors.

[1]  Timothy X. Brown,et al.  Neural Network Design of a Banyan Network Controller , 1990, IEEE J. Sel. Areas Commun..

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

[3]  T.X. Brown,et al.  Neural networks for switching , 1989, IEEE Communications Magazine.

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

[5]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[6]  Yoshiyasu Takefuji,et al.  A parallel algorithm for allocation of spare cells on memory chips , 1991 .

[7]  Yoshiyasu Takefuji,et al.  A super-parallel sorting algorithm based on neural networks , 1990 .

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

[9]  Frank K. Hwang,et al.  On Nonblocking Multiconnection Networks , 1986, IEEE Trans. Commun..

[10]  Yoshiyasu Takefuji,et al.  A neural network parallel algorithm for clique vertex-partition problems , 1992 .

[11]  Andrzej Jajszczyk,et al.  The Effect of Choosing the Switches for Rearrangements in Switching Networks , 1980, IEEE Trans. Commun..

[12]  A. Marrakchi,et al.  A neural net arbitrator for large crossbar packet-switches , 1989 .

[13]  Yoshiyasu Takefuji,et al.  A parallel algorithm for channel routing problems [VLSI] , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  M. Paull.  Reswitching of connection networks , 1962 .

[15]  V. E. Benes,et al.  Blocking states in connecting networks made of square switches arranged in stages , 1981, The Bell System Technical Journal.

[16]  Giovanni Colombo,et al.  Asynchronous control algorithms for increasing the efficiency of three-stage connecting networks for multipoint services , 1990, IEEE Trans. Commun..

[17]  Yoshiyasu Takefuji,et al.  A Neural Network Model for Finding a Near-Maximum Clique , 1992, J. Parallel Distributed Comput..

[18]  Y Takefuji,et al.  A Near-Optimum Parallel Planarization Algorithm , 1989, Science.

[19]  N. Skaperda.  Some Architectural Alternatives in the Design of a Digital Switch , 1979, IEEE Trans. Commun..

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

[21]  Yoshiyasu Takefuji,et al.  Artificial neural networks for four-coloring map problems and K-colorability problems , 1991 .

[22]  N. Tsao-Wu.  On Neiman's Algorithm for the Control of Rearrangeable Switching Networks , 1974, IEEE Trans. Commun..

[23]  M. Ackroyd.  Call Repacking in Connecting Networks , 1979, IEEE Trans. Commun..

[24]  Yoshiyasu Takefuji,et al.  A parallel algorithm for tiling problems , 1990, IEEE Trans. Neural Networks.