摘要
本文主要介绍超级计算机中错误多级互联网络的DFA图的构造方法并用该图来判定相应的多级互联网络是否是有DFA能力,从而进一步决定能否从错误网络中任一处理器开始在有限步内将数据传递到任何其他处理器,即容错路由选择能力。
This paper mainly introduces the construction method of the dynamic full access(DFA) graph of the fault multistage interconnection network(MIN) in a supercom-puter,to determine if the corresponding MIN has DFA capability, and further to decide whether or not the fault MIN can route data from any processor in the system to any other processor in a finite number of pass es through the network.i. e.,fault tolerant routing capability.
出处
《浙江师大学报(自然科学版)》
1997年第3期42-47,共6页
Journal of Zhejiang Normal University(Natoral Sciences)