A new routing algorithm for the shuffle-exchange permutation network

被引:1
|
作者
Chen B. [1 ,2 ]
Xiao W. [3 ]
Du N. [4 ]
机构
[1] College of Mathematics and System Science, Xinjiang University
[2] Department of Computer Science, Zhangzhou Teacher's College
[3] Department of Computer Science, South China University of Technology
[4] Department of Mathematics, Xiamen University
关键词
Cayley graph; Fixed degree; Routing; Shuffle-exchange permutation network;
D O I
10.1007/s11424-006-0586-2
中图分类号
学科分类号
摘要
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/16n 2+O(n), i.e., the diameter of SEP n 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 SEP n is more than 1/2n 2. © Springer Science + Business Media, Inc. 2006.
引用
收藏
页码:586 / 591
页数:5
相关论文
共 50 条