Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Design and Performance Analysis of Load-Distributing Fault-Tolerant Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Analyzing permutation capability of multistage interconnection networks with colored Petri nets
Information Sciences: an International Journal
Hi-index | 14.99 |
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.