Conflict analysis of multistage interconnection networks

Abstract

In most applications, some permutations are used more frequently than others. Therefore, it is necessary to determine the efficiency with which various MINs realize the set of frequently used permutations. It is known that the problem of determining the exact number of passes to realize a permutation is NP-complete. We present an efficient algorithm to determine the upper bound on the number of passes by first finding an O(NlogN) algorithm for conflict detection.<>