| 精确计算n维Mesh网络和n维Torus网络的平均最短路径长度 |
| |
| 引用本文： | 董迎飞,王鼎兴.精确计算n维Mesh网络和n维Torus网络的平均最短路径长度[J].计算机学报,1997,20(4):376-380. |
| |
| 作者姓名： | 董迎飞 王鼎兴 |
| |
| 作者单位： | 清华大学计算机科学与技术系 |
| |
| 摘 要： | ｎ维ｍｅｓｈ网张和ｎ维ｔｏｒｕｓ网络是分布存储多机系统中最常用的拓扑结构。网络的平均最短路径长度是网张性能的重要指标。
|
| 关 键 词： | Mesh网络 torus网络 互连网络 寻径算法 |
EXACT COMPUTATION OF THE MEAN MINIMAL PATH LENGTH OF N-MESH AND N-TORUS |
| |
| DONG Yingfei, WANG Dingxing, ZHENG Weimin.EXACT COMPUTATION OF THE MEAN MINIMAL PATH LENGTH OF N-MESH AND N-TORUS[J].Chinese Journal of Computers,1997,20(4):376-380. |
| |
| Authors: | DONG Yingfei WANG Dingxing ZHENG Weimin |
| |
| Abstract: | N-mesh and n-torns are very popular topologies used in modern distributed memory multicomputers. The mean minimal path length of a network is a key feature of its performance. This paper gives an exact definition of the mean minimal path length of a network,and exact formulas computing the mean minimal path length of n-mesh and n-torns. |
| |
| Keywords: | Mesh network torns network interconnection network routing algorithm mean minimal path length |
| 本文献已被 CNKI 维普 等数据库收录！ |
