基于同构SMP集群的管道式轮询广播算法研究

Pipelined Round-Robin Broadcast Algorithm in Homogeneous Clusters of SMP

本论文提出了在同构对称多处理器(SMP)的集群环境下适用长数据的新型广播算法.该算法基于管道式轮询调度机制.它全程利用所有的系统通信资源,从而使得通信性能接近理论性能值.这意味着在由偶数个节点组成网络上广播大数据时,广播执行时间约等于把该数据从一个节点传输到另一个节点的时间.本文中作者对该算法和其它在高性能计算中常见算法进行了性能比较.结论为该算法在同构SMP集群环境下,广播大数据的性能明显优于其它算法.

This study proposes a novel broadcast algorithm for large-sized data over symmetric multiprocessor（SMP） clusters. The algorithm is based on round-robin scheduling,and a pipelined data scattering pattern. It can salvage all available communication resources of systems at every point in time and is thereby capable of achieving approximately the theoretical limit of performance. This implies that for a large data size on a network with any even number of nodes,the broadcast execution time is approximately the time required for a node to send data to another node. We compare the performance of the algorithm with that of broadcast algorithms that are widely used in high-performance computing systems.