arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.01814cs.DC
收藏

在异构集群中分布稀疏矩阵/图应用的实验研究

Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters -- an Experimental Study

Charilaos Tzovas, Maria Predari, Henning Meyerhenke

摘要:

科学和工程应用中的许多问题都包含稀疏矩阵或图作为主要输入对象,例如网格上的数值模拟。现在大量的输入都需要并行处理来获得内存大小和速度。为了优化集群系统上的这种模拟的执行,输入问题需要适当地分布到处理单元(PU)上。越来越多的情况下,这样的集群包含不同的CPU或CPU和GPU的组合。这种异质性使得负载分配问题非常具有挑战性。我们的研究是出于观察,建立分区工具不处理这种异构分布的问题,以及同质的。在本文中,我们首先制定的异构体系结构的平衡负载分配问题作为一个多目标,单约束优化问题。然后,我们将问题分为两个阶段,并提出了一种贪婪的方法来确定每个PU的最佳块大小。然后将这些块大小输入到许多现有的图划分器中,以便我们检查它们如何处理上述问题。我们考虑的工具之一是我们自己以前的工作(von Looz等人,ICPP '18)的扩展,称为地理学家。我们在知名的基准网格上的实验表明,只有两种工具能够产生良好的质量。这两个是帕尔梅提斯(几何和组合变体)和地理学家。虽然Parmetis速度更快,但Geographer的平均质量更好。

英文摘要:

Many problems in scientific and engineering applications contain sparse matrices or graphs as main input objects, e.g. numerical simulations on meshes. Large inputs are abundant these days and require parallel processing for memory size and speed. To optimize the execution of such simulations on cluster systems, the input problem needs to be distributed suitably onto the processing units (PUs). More and more frequently, such clusters contain different CPUs or a combination of CPUs and GPUs. This heterogeneity makes the load distribution problem quite challenging. Our study is motivated by the observation that established partitioning tools do not handle such heterogeneous distribution problems as well as homogeneous ones. In this paper, we first formulate the problem of balanced load distribution for heterogeneous architectures as a multi-objective, single-constraint optimization problem. We then split the problem into two phases and propose a greedy approach to determine optimal block sizes for each PU. These block sizes are then fed into numerous existing graph partitioners, for us to examine how well they handle the above problem. One of the tools we consider is an extension of our own previous work (von Looz et al, ICPP'18) called Geographer. Our experiments on well-known benchmark meshes indicate that only two tools under consideration are able to yield good quality. These two are Parmetis (both the geometric and the combinatorial variant) and Geographer. While Parmetis is faster, Geographer yields better quality on average.

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

↑