具有大量错误结点的k元n立方体广播路由

下载PDF

导出

摘要本文在k元n立方的m子立方体连通图的基础上提出了可容纳大量错误结点的容错路由算法,并讨论了算法的时间步的上界。

作者张涌逸

机构地区太原师范学院计算机系

出处《数字技术与应用》 2012年第9期22-22,共1页 Digital Technology & Application

关键词 k元n立方体广播容错路由 k元n立方的m子立方体连通图

参考文献2

1Chen Jianer, Wang Guojun, Chen Songqiao. Locally Subcube-connected Hypercube Networks: Theoretical Analysis and Experimental Results. IEEE Transactions on Computers, 2002,51(5):530-540
2Lee T C, Hayes J P. A Fault-tolerant Communication Scheme for Hypercube Computer. IEEE Trans. Computers, 1992,41 (10):1242-1256
3Chiu G M, Wu S P. A Fault-tolerant Routing Strategy in Hypercube Multicomputers. IEEE Trans. Computers, 1996,45(2): 143-155
4Chen M S, Shin K G. Adaptive Fault-tolerant Routing in Hypercube Multicomputers. IEEE Transactions On Computers, 1990,39(12)
5Esfahanian A H. Generalized Measures of Fault Tolerance with Application to n-Cube Networks. IEEE Trans. Computers, 1989,38(11):1586-1591
6Latifi S. Combinatorial Analysis of the Fault Diameter of the N-cube.IEEE Trans. Computers, 1993,42(1):27-33
7Gu Q P, Peng S. Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. The Computer J., 1996,39(7):626-629
8Gu Q P, Peng S. k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers, 1997,46(9):1042-1049
9王国军,陈建二,陈松乔.具有大量错误结点的超立方体网络中的高效路由算法的设计与讨论[J].计算机学报,2001,24(9):909-916. 被引量：50
10王国军,陈松乔,陈建二.具有大量错误结点的超立方体网络中并行路由算法[J].计算机工程与科学,2001,23(5):5-12. 被引量：4

数字技术与应用

2012年第9期

内容加载中请稍等...