| k元n树互联网络的2-终点可靠性研究 |
| |
| 引用本文： | 黄江洪,肖子枫,韩承德. k元n树互联网络的2-终点可靠性研究[J]. 计算机工程, 2008, 34(11): 32-34 |
| |
| 作者姓名： | 黄江洪 肖子枫 韩承德 |
| |
| 作者单位： | 1. 中国科学院计算技术研究所,北京,100080;中国科学院研究生院,北京,100039
2. 中国科学院计算技术研究所,北京,100080 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划) , 国家自然科学基金 |
| |
| 摘 要： | k元n树是一种用于大规模并行处理的高性能互联网络的拓扑结构。该文提出计算k元n树的2-终点可靠性的递归算法，其计算复杂度为O(n)。结合市场上网络元器件可靠性的实际情况，对k元n树的2-终点可靠性进行了分析。当n趋于无穷大时，计算出k元n树的2-终点可靠性的下限。
|
| 关 键 词： | k元n树 2-终点可靠性 计算复杂度 下限 |
| 文章编号： | 1000-3428(2008)11-0032-03 |
| 修稿时间： | 2007-06-10 |
Research on Two-terminal Reliability of k-ary n-tree Interconnection Networks |
| |
| HUANG Jiang-hong,XIAO Zi-feng,HAN Cheng-de. Research on Two-terminal Reliability of k-ary n-tree Interconnection Networks[J]. Computer Engineering, 2008, 34(11): 32-34 |
| |
| Authors: | HUANG Jiang-hong XIAO Zi-feng HAN Cheng-de |
| |
| Affiliation: | (1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 2. Graduate University of Chinese Academy of Sciences, Beijing 100039) |
| |
| Abstract: | k-ary n-tree is a kind of topology of high performance interconnection networks for parallel architectures. A recursive algorithm is presented to calculate two-terminal reliability of k-ary n-tree. Its computational complexity is O(n). Taking the reliability of commercial network components into consideration, this paper analyzes two-terminal reliability of k-ary n-trees. When n tends to be infinite, the lower bound of two-terminal reliability of k-ary n-tree is given. |
| |
| Keywords: | k-ary n-tree two-terminal reliability computational complexity lower bound |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
