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).
展开▼
