IEEE Transactions on Computers · 1987 · 68 citations · 9 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksInterconnection NetworksNetwork ArchitectureNetwork SwitchingBenes NetworksComplete Residue SystemsControl Algorithm DevelopmentPartitioningSwitching Algorithm DesignSwitching Algorithms
The original Benes network control algorithm was recursive, whereas the new algorithm is not. The paper presents a new Benes network control algorithm. The algorithm decomposes an N×N Benes network into two subnetworks, SN1 and SN2, controlled by a Complete Residue Partition Tree and bit control respectively, and sets switches stage by stage.
A new Benes network control algorithm is presented. Unlike the original looping algorithm, the new algorithm is not recursive. In this algorithm (N x N) Benes network is viewed as a concatenation of two subnetworks SN1 and SN2. The first (log N - 1) stages of a Benes network correspond to SN1, and the remaining log N stages correspond to SN2. SN1 is controlled by a full binary tree of set partitioning functions, called a Complete Residue Partition Tree, and SN2 is bit controlled. The new control algorithm sets switches one stage at a time, stage by stage.
9
A Study of Non-Blocking Switching Networks
Charles Clos · Bell System Technical Journal · 1953 · 1.7K citations
Abraham Waksman · Journal of the ACM · 1968 · 444 citations · Full text