Reconfiguration Algorithms for Interconnection Networks
IEEE Transactions on Computers
On the permutation capability of multistage interconnection networks
IEEE Transactions on Computers
Properties of multistage interconnection networks
Properties of multistage interconnection networks
A Fast Algorithm for Testing Isomorphism of Permutation Networks
IEEE Transactions on Computers
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Functional and Topological Relations Among Banyan Multistage Networks of Differing Switch Sizes
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
Existing procedures to decide network equivalence in log N-stage banyan networks are based on analysis of permutations, take polynomial but costly time, and do not shed light on or take advantage of the relationship between functionality and topology. This relationship is addressed and it is shown that two log N-stage banyan networks of the same switch size are functionally equivalent if and only if they have the same underlying topology. An O(N log N) algorithm is derived which decides if two N-stage banyan networks of N inputs, N outputs, and r*r crossbar switches as building blocks realize the same permutations. The algorithm works by comparing the underlying topologies of the two networks. The algorithm is optimal because the size of the networks is O(N log N).