Title :
Conflict analysis of multistage interconnection networks
Author :
Potlapalli, Yashovardhan R. ; Agrawal, Dharma P.
Author_Institution :
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
fDate :
31 Jan-2 Feb 1994
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
Keywords :
computational complexity; multiprocessor interconnection networks; Inverse Indirect Binary Cube network; MINs; buddy-type MIN; conflict analysis; conflict detection; efficient algorithm; multistage interconnection networks; upper bound; Application software; Computer networks; Contracts; Fault tolerance; Multiprocessor interconnection networks; Routing; Switches; Terminology; Upper bound;
Conference_Titel :
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1994., MASCOTS '94., Proceedings of the Second International Workshop on
Conference_Location :
Durham, NC
Print_ISBN :
0-8186-5292-6
DOI :
10.1109/MASCOT.1994.284435
