A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK  

作　　者：Baoxing CHEN Wenjun XIA Ni DU 

机构地区：[1]College of Mathematics and System Science, Xinjiang University, Wulumuqi, 830046 [2]Department of Computer Science, Zhangzhou Teacher's College, Zhangzhou 363000, China. [3]Department of Computer Science, South China University of Technology, Guangzhou 510641, China. [4]Department of Mathematics, Xiamen University, Xiamen 361005, China.

出　　处：《Journal of Systems Science & Complexity》2006年第4期586-591,共6页系统科学与复杂性学报（英文版）

基　　金：This work was supported by the NatLiral Science Foundation of Fujian Provmce(No.Z0511035);the Scientific Research Foundation of Fujian Provincial Education Department(No.JA04249)

摘　　要：In this paper, a new routing algorithm is given for the shuffle-exchange permutation network （SEPn）. The length of the path between any two nodes given by our algorithm is not more than 11/16n^2＋O（n）, i.e., the diameter of SEPn is at most 11/16n^2＋ O（n）. This improves on a 1/8（9n^2- 22n＋24） routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n.

关 键 词：Cayley graph fixed degree routing shuffle-exchange permutation network. 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]