arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.04164cs.DCcs.DS
收藏

更好的进程映射和稀疏二次分配

Better Process Mapping and Sparse Quadratic Assignment

Christian Schulz, Jesper Larsson Träff, Konrad von Kirchbach

摘要:

通信和拓扑感知进程映射是一种有效的方法,可以减少大型分布式内存系统上具有已知通信模式的并行应用程序的通信时间。我们解决的问题,作为一个二次分配问题(QAP),并提出算法来构建初始映射的进程处理器,快速局部搜索算法,以进一步提高映射。通过利用假设,通常持有的应用程序和现代超级计算机系统,如稀疏的通信模式和分层组织的通信系统,我们获得这些特殊的QAP更强大的算法。我们的多级构造算法采用完全平衡的图划分技术,并利用给定的通信系统层次结构的显着方式。我们对Brandfass等人(2013)的局部搜索算法进行了改进,并通过减少分配中执行交换所需的时间以及仔细约束局部搜索邻域来进一步减少运行时间。我们还研究了不同的算法来创建映射到处理器网络的通信图。实验表明,我们的算法不仅大大加快了局部搜索,但由于多级方法也找到更好的解决方案在实践中。

英文摘要:

Communication and topology aware process mapping is a powerful approach to reduce communication time in parallel applications with known communication patterns on large, distributed memory systems. We address the problem as a quadratic assignment problem (QAP), and present algorithms to construct initial mappings of processes to processors, and fast local search algorithms to further improve the mappings. By exploiting assumptions that typically hold for applications and modern supercomputer systems such as sparse communication patterns and hierarchically organized communication systems, we obtain significantly more powerful algorithms for these special QAPs. Our multilevel construction algorithms employ perfectly balanced graph partitioning techniques and exploit the given communication system hierarchy in significant ways. We present improvements to a local search algorithm of Brandfass et al. (2013), and further decrease the running time by reducing the time needed to perform swaps in the assignment as well as by carefully constraining local search neighborhoods. We also investigate different algorithms to create the communication graph that is mapped onto the processor network. Experiments indicate that our algorithms not only dramatically speed up local search, but due to the multilevel approach also find much better solutions in practice.

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

↑