Title :
Bounds on the number of passes in multistage interconnection networks
Author :
Potlapalli, Yashovardhan R. ; Agrawal, Dharma P.
Author_Institution :
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
Abstract :
Determining the exact number of passes required to realize a permutation on a multistage interconnection network (MIN) is known to be an 𝒩𝒫 Complete problem. We present a new characteristic of conflicts in MINs which makes conflict detection easier. We use this important property to develop a polynomial time algorithm to determine strong upper and lower bounds on the number of passes required to realize a permutation
Keywords :
communication complexity; computational complexity; multiprocessor interconnection networks; optimisation; parallel architectures; NP complete problem; conflict detection; conflicts; lower bounds; multistage interconnection networks; parallel architecture; passes; permutation; polynomial time algorithm; upper bounds; Genetic mutations; Intelligent networks; Multiprocessor interconnection networks; Parallel algorithms; Parallel architectures; Polynomials; Routing; Switches; Testing; Upper bound;
Conference_Titel :
Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-6427-4
DOI :
10.1109/SPDP.1994.346134
