面向超大规模计算系统的监控、调度及网络优化实践

秦晓宁,王家尧,胡梦龙,苏勇,万伟,李斌,戴荣,王志鹏,吉青

Practices on Monitoring, Scheduling, and Interconnection optimization of Super-Large Computing System

Qin Xiaoning,Wang Jiayao,Hu Menglong,Su Yong,Wan Wei,Li Bin,Dai Rong,Wang Zhipeng,Ji Qing

表3 3D-Torus与Fat-tree网络拓扑的理论对比,其中N为节点数,f为优化因子

Table3 The theoretical comparison on 3D-Torus and Fat-tree topology. N is the nodes number and f is the optimizing indicator.

三线表绘制拓扑	3D Torus	6D Torus	Fat Tree
类型	直接	直接	间接
交换机数量	N	N	Nlog_fN
线缆数量	3N	6N	fNlog_fN
平均延迟	$\frac{3}{4} N^{1 / 3}$	$3$ $($ $N^{1 / 6} - N^{- 1 / 6}) /$ 2	2(log_fN-1）< L < 2log_fN
双向带宽	$2 N^{2 / 3}$	$2 N^{1 / 3}$	fN
近邻优化	Yes	Yes	Yes