arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1110.2677cs.DC
收藏

混合静态/动态调度,用于已优化的密集矩阵分解

Hybrid static/dynamic scheduling for already optimized dense matrix factorization

Simplice Donfack, Laura Grigori, William D. Gropp, Vivek Kale

摘要:

我们提出了使用的混合静态/动态调度策略的任务依赖图的直接方法中使用的密集数值线性代数。该策略提供了数据局部性、负载平衡和低出队开销的平衡。我们表明,这种调度在通信中的使用,避免密集因式分解导致显着的性能增益。在一个48核AMD皓龙NUMA机器上,我们的实验表明,我们可以实现高达64%的改进,超过一个版本的CALU,使用完全动态调度,和高达30%的改进,超过版本的CALU,使用完全静态调度。在16核Intel Xeon计算机上,我们的混合静态/动态调度方法比使用完全静态调度或完全动态调度的CALU版本快8%。我们的算法导致加速比相应的例程计算LU因式分解在知名的图书馆。在48核AMD NUMA机器上,我们的最佳实现比MKL快110%,而在16核Intel Xeon机器上,它比MKL快82%。我们的方法也显示出显着的加速比PLASMA在这两个系统上。

英文摘要:

We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully static scheduling. On a 16-core Intel Xeon machine, our hybrid static/dynamic scheduling approach is up to 8% faster than the version of CALU that uses a fully static scheduling or fully dynamic scheduling. Our algorithm leads to speedups over the corresponding routines for computing LU factorization in well known libraries. On the 48 core AMD NUMA machine, our best implementation is up to 110% faster than MKL, while on the 16 core Intel Xeon machine, it is up to 82% faster than MKL. Our approach also shows significant speedups compared with PLASMA on both of these systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑