We discuss in this paper Benes Switching Interconnection Network(SIN). Benes IN is a rearrangeable type of communication system. It has better cost compare to cross-bar SIN in terms of the number of switching elements. The main problem is, Benes SIN needs O(N log2N) time steps to realize N! permutation between its input audits output, where N is the number of the SIN's terminals. (assuming the number of input terminals equal to that of the output, and N is base 2.) This problem makes such type of SIN unpractical for intelligent communication networks, which need flexible and high speed capability of reconfiguration, necessary to support arbitrary commumcation patterns through the SIN.In thispaper we give a new fast parallel algorithm which is able to set Benes SIN in time steps of O(k log N), where 0≦k≦log N. Our algorithm depends on radix sort algorithm and parallel configuration of cyclic cube configuration of parallel processors of type message passing computational model. We also, show the effectiveness of our high speed algorithm using several examples.
展开▼
