A constant queue partial permutation routing algorithm for cube-connected-cycles multicomputer systems

被引：0
|
作者：
Jan, GE [1 ]
Lin, MB [1 ]
Chao, A [1 ]
Liang, D [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Elect Engn, Taipei 106, Taiwan
来源：
SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS: WORKSHOPS, PROCEEDINGS | 2000年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, a general routing paradigm is considered and then applied to the routing and partial permutation routing problems on CCC(n, 2(n)) networks. The major idea of the general routing paradigm is based on the binary radix sorting scheme in which each bit of keys (i.e., destination addresses) from MSB is separated in sequence until reached the LSB. The result is a sorted sequence. Based on this scheme, the partial permutation routing problem on CCC(n, 2(n)) networks can be solved in O(n(2)) time with O(1) buffers for each node, where n is the dimension of CCC(n, 2(n)) networks.
引用
收藏
页码：35 / 40
页数：4
相关论文
共 20 条
12