Rearrangeable three-stage interconnection networks and their routing properties

A rearrangeable network is an interconnection network which can achieve all possible permutations of its inputs´ connections to its outputs. One class of rearrangeable networks, which have been studied are Clos three-stage networks. Earlier procedures to route such networks rapidly require an excessive amount of hardware, either in the network itself or in the device required to compute the routing. A class of rearrangeable three-stage networks which is both compact and which can be routed quickly is introduced, along with a routing scheme. Switches are added to the network so as to reduce the interdependence between the switch settings, allowing faster routing while only moderately increasing network complexity. A network with O(Nlog ^1.5N) hardware and O(log^1.5N ) depth is derived from O(log^2.5N) switch setup time