Title :
Optimally routing LC permutations on k-extra-stage cube-type networks
Author :
Hu, Qing ; Shen, Xiaojun ; Liang, Weifa
Author_Institution :
Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA
fDate :
1/1/1996 12:00:00 AM
Abstract :
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
Keywords :
multistage interconnection networks; optimisation; BPC class of permutations; LC permutations; conflict-free paths; k-extra-stage cube-type networks; multi-stage networks; multistage interconnection networks; omega network; optimal algorithm; permutation realization; Cities and towns; Computer science; Concurrent computing; Fault tolerance; Genetic mutations; Linear algebra; Multiprocessor interconnection networks; Partitioning algorithms; Polynomials; Routing;
Journal_Title :
Computers, IEEE Transactions on
