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

关于对称矩形线性矩阵的划分

On Symmetric Rectilinear Matrix Partitioning

Abdurrahman Yaşar, Muhammed Fatih Balin, Xiaojing An, Kaan Sancak, Ümit V. Çatalyürek

摘要:

在许多应用中,将不规则的工作负载均匀地分配到处理单元对于高效并行化是至关重要的。在这项工作中,我们关注的是一个空间划分称为直线分割(也称为广义块分布)的稀疏矩阵。更具体地说,在这项工作中,我们解决了一个方阵的对称直线分割的问题。所谓对称,我们的意思是矩阵的行和列被相同地划分,从而产生一个平铺,其中对角瓦片(块)将是正方形。我们首先表明,这个问题的最佳解决方案是NP难的,我们提出了四个算法来解决这个问题的两个不同的变种。我们提出了一个彻底的分析这些建议的算法的计算复杂性。为了使所提出的技术更适用于现实生活中的应用场景,我们进一步降低其计算复杂性,利用有效的稀疏化策略与高效的稀疏前缀和数据结构。实验结果表明,所提出的算法是高效和有效的超过六百个测试矩阵。通过稀疏化,我们的方法在现代24核系统上的Twitter图中花费不到3秒的时间,并输出负载不平衡不超过1%的解决方案。

英文摘要:

Even distribution of irregular workload to processing units is crucial for efficient parallelization in many applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as generalized block distribution) of sparse matrices. More specifically, in this work, we address the problem of symmetric rectilinear partitioning of a square matrix. By symmetric, we mean the rows and columns of the matrix are identically partitioned yielding a tiling where the diagonal tiles (blocks) will be squares. We first show that the optimal solution to this problem is NP-hard, and we propose four heuristics to solve two different variants of this problem. We present a thorough analysis of the computational complexities of those proposed heuristics. To make the proposed techniques more applicable in real life application scenarios, we further reduce their computational complexities by utilizing effective sparsification strategies together with an efficient sparse prefix-sum data structure. We experimentally show the proposed algorithms are efficient and effective on more than six hundred test matrices. With sparsification, our methods take less than 3 seconds in the Twitter graph on a modern 24 core system and output a solution whose load imbalance is no worse than 1%.

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

↑