基于拉丁方的短消息全交换通信算法

Short-message All-to-All Communication Algorithm Based on Latin-square

并行算法中的全交换通信类似于方阵转置变换,拉丁方在这个变换中可起着重要的承接作用。为此,提出一种基于拉丁方有效实现短消息全交换通信的软件方法。利用拉丁方将全交换通信划分为本地内存拷贝和集合消息2个部分。通过模型分析出短消息全交换通信优于直接通信的消息量的上界。实验验证了该方法的有效性。

All-to-all communication in parallel algorithm is similar to transposing a square matrix. The Latin-square plays an important role as commutator in the process. This paper proposes an efficiently realization of short-message all-to-all communication algorithm based on Latin Square, and constructs a model analysis on this maximum message-volume, which is prior to the direct algorithm. Some tests verify this algorithm and model without considering the detail of network topology.