提示
肖文俊
-
41浏览
-
0点赞
-
0收藏
-
0分享
-
44下载
-
0评论
-
引用
期刊论文
A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK*
Jrl Syst Sci & Complexity (2006) 19: 586-591，-0001，（）：
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/16n2+O(n), Le., the diameter of SEPn is most 11/16n2+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 of SEPn is more than 2n2-n.
【免责声明】以下全部内容由[肖文俊]上传于[2011年01月24日 09时52分12秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
