2013 42nd International Conference on Parallel Processing (1994)
North Carolina State University
Aug. 15, 1994 to Aug. 19, 1994
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.1994.38
Tse-yun Feng , The Pennsylvania State University, USA
Yanggon Kim , The Pennsylvania State University, USA
This paper introduces a new tag scheme having a flexibility and a bidirectionality for an N ? N k-stage shuffle-exchange network where k \ge log_2 N. Based on the interstage correlations for a path, the EB-tag generating rules are presented. In addition, an elegant and simple graphical representation called a N-leaf Dual Complete Binary tree (N-leaf DCB-tree) for a given permutation is proposed and its characteristics are discussed. Then the universal necessary condition for a conflict-free connection pattern is given. Due to this condition, the conflict-free routing problem can be transformed to the perfect assignment problem.
conflict-free, graph representation, multistage interconnection networks, routing tag, shuffle-exchange networks.
Tse-yun Feng, Yanggon Kim, "A New Tag Scheme and Its Tree Representation for a Shuffle-Exchange Network", 2013 42nd International Conference on Parallel Processing, vol. 01, no. , pp. 109-112, 1994, doi:10.1109/ICPP.1994.38