The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for all source-destination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multi-stage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network.</p>
k-extra-stage cube-type networks, LC permutations, multistage interconnection networks, optimization problems, permutation realization, routing.

Q. Hu, X. Shen and W. Liang, "Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks," in IEEE Transactions on Computers, vol. 45, no. , pp. 97-103, 1996.
94 ms
(Ver 3.3 (11022016))