Parallel Prefix (Scan) Algorithms for MPI
Parallel Prefix (Scan) Algorithms for MPI
复制标题
MPI 并行前缀（扫描）算法
DOI：
10.1007/11846802_15
复制
发表时间：
2006
影响因子：
4.3
通讯作者：
J. Träff
中科院分区：
文献类型：
--
作者：
P. Sanders;J. Träff
我们描述和实验比较了平行前缀操作（以MPI术语扫描）的理论上众所周知的四种算法，并给出了一个可能是新颖的，偶尔的，双重的二进制二进制树并行前缀前缀算法的实现。双向互连可以从该实现中受益。我们介绍了32个节点AMD群集的结果，该群集与Myrinet 2000和72节点SX-8并行矢量系统。双式算法比在许多MPI实施中发现的直接二项式树算法要快的算法要快。但是，由于其较小的恒定因素，对于具有适度处理器数量的系统，更简单的线性管道算法是可取的。我们还讨论将算法适应SMP节点的簇。
We describe and experimentally compare four theoretically well-known algorithms for the parallel prefix operation (scan, in MPI terms), and give a presumably novel, doubly-pipelined implementation of the in-order binary tree parallel prefix algorithm. Bidirectional interconnects can benefit from this implementation. We present results from a 32 node AMD Cluster with Myrinet 2000 and a 72-node SX-8 parallel vector system. The doubly-pipelined algorithm is more than a factor two faster than the straight-forward binomial-tree algorithm found in many MPI implementations. However, due to its small constant factors the simple, linear pipeline algorithm is preferable for systems with a moderate number of processors. We also discuss adapting the algorithms to clusters of SMP nodes.