Rearrangeable three-stage interconnection networks and their routing properties

Publisher Website
Google Scholar
Abstract
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 new class of rearrangeable three-stage networks is introduced, which is both compact and which can be routed quickly, with a new 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(N log1.5 N) hardware and O(log1.5 N) depth is derived with O(log 2.5 N) switch setup time.

This publication has 12 references indexed in Scilit: