Abstract: This paper analyses the MRC architecture in a distributed parallel computer(the Option Red),and transferes the three-dimensional net to a special plan. It brings forward an algorithm to finding the shortest path. The results indicat this algorithm has high accuracy and velocity.

摘要： 针对The Option Red并行机中的MRC网络结构，将立体网络转换成平面图形，提出一种最短路径查找算法。结果表明该算法具有较高的准确性和较快的速度。

关键词: 并行机, 最短路径, 虫孔寻径

CLC Number: 

• TP333