EXACT COMPUTATION OF THE MEAN MINIMAL PATH LENGTH OF N-MESH AND N-TORUS

Dong Yingfe · Chinese Journal of Computers · 1997

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.

Read the paper · More papers on PaperTik