2013 42nd International Conference on Parallel Processing (1996)
Aug. 12, 1996 to Aug. 16, 1996
Yanggon Kim , Dept. of Electr. Eng., Princeton Univ., NJ, USA
Tse-yun Feng , Dept. of Electr. Eng., Princeton Univ., NJ, USA
Seung-Woo Seo , Dept. of Electr. Eng., Princeton Univ., NJ, USA
Abstract: We recently proposed a new algorithm which routes a class of 2log/sub 2/N- or (2log/sub 2/N-1)-stage rearrangeable networks. Although we discussed some of the general rules for proper routing, detailed strategies for resolving possible conflicts were not mentioned. In this paper, we point out additional conditions which enable conflict-free routing in the original algorithm. Cyclic property at the center stages is analyzed in more detail. We also show that the routing problem in the concatenation of two omega networks known as 2log/sub 2/N-stage shuffle network, is in the class of NP-completeness.
multistage interconnection networks; reconfigurable architectures; parallel algorithms; resource allocation; computational complexity; inside-out routing algorithm; conflict resolutions; rearrangeable networks; conflict-free routing; omega networks; shuffle network; NP-completeness
Yanggon Kim, Tse-yun Feng, Seung-Woo Seo, "(R) Conflict Resolutions in the Inside-Out Routing Algorithm", 2013 42nd International Conference on Parallel Processing, vol. 01, no. , pp. 0026, 1996, doi:10.1109/ICPP.1996.537140