A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK

被引：0

作者：

Baoxing CHEN College of Mathematics and System ScienceXinjiang UniversityWulumuqi ^{[830046
]}

Department of Computer ScienceZhangzhou Teachers CollegeZhangzhou ChinaEmailcbaoxinghotmailcomWenjun XIA Department of Computer ScienceSouth China University of TechnologyGuangzhou ChinaNi DU Department of MathematicsXiamen UniversityXiamen China ^{[363000
,510641
,361005
]}

机构：

来源：

Journal of Systems Science & Complexity | 2006年 / 04期

关键词：

Cayley graph; fixed degree; routing; shuffle-exchange permutation network;

D O I：

暂无

中图分类号：

TP301.6 [算法理论];

学科分类号：

081202 ;

摘要：

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

引用

页码：586 / 591

页数：6