The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1993 vol.42)
pp: 559-567
ABSTRACT
<p>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/sup 1.5/N) hardware and O(log/sup 1.5/N) depth is derived from O(log/sup 2.5/N) switch setup time.</p>
INDEX TERMS
rearrangeable network; interconnection network; permutations; Clos three-stage networks; routing scheme; switch settings; network complexity; computational complexity; multiprocessor interconnection networks.
CITATION
B.G. Douglass, "Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties", IEEE Transactions on Computers, vol.42, no. 5, pp. 559-567, May 1993, doi:10.1109/12.223675
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool