基于子网的三维Mesh网络容错广播路由算法

Submesh-based Fault Tolerant Broadcast Routing Algorithm on3-Dimensional Mesh Networks

在并行计算机系统中,广播通信是极为重要的通信模式之一。该文基于k-Mesh子网(子立方体)连通的概念提出一个基于局部信息和分布式的三维Mesh网络容错广播路由算法。该算法利用邻结点的状态信息,动态地构建以单个k-Mesh子网为结点的广播树,该广播树能容忍相当多的结点出错。模拟结果表明广播路由算法的广播时间步接近最优的。该算法只要求结点知道它的邻结点的状态,而无需知道整个网络状态信息,也就是说,这些算法是基于局部信息的,因而具有很好的实际意义。

In parallel computing systems ,one -to -all or broadcast communication is one of the most important communication patterns and occurs in many important applications in parallel computing.This paper proposes a fault tolerant ,local -information -based,and distributed broadcast routing algorithm based on the concept of k -submesh -connectivity in all-port mesh networks.Simulation results show that the algorithm is practically efficient and effective,and the time steps of the algorithm are very close to the optimum.