Hierarchical block multi-color ordering: a new parallel ordering method for vectorization and parallelization of the sparse triangular solver in the ICCG method
Hierarchical block multi-color ordering: a new parallel ordering method for vectorization and parallelization of the sparse triangular solver in the ICCG method
复制标题
DOI：
10.1007/s42514-020-00030-z
复制
发表时间：
2019-08
影响因子：
0.9
通讯作者：
T. Iwashita;Senxi Li;Takeshi Fukaya
中科院分区：
文献类型：
--
作者：
T. Iwashita;Senxi Li;Takeshi Fukaya
本文提出了一种新的并行排序方法来实现稀疏三角形求解器的矢量化和并行化，称为层次块多色排序。在该方法中，并行的向前和向后替换可以被矢量化，同时保留块多色排序的优点，即快速收敛和较少的线程同步。为了在并行ICCG（不完全乔列斯基共轭梯度）求解器中评估所提出的方法，使用七个测试矩阵在三种类型的计算节点上进行了数值测试。数值结果表明，在21个测试用例中，有18个测试用例的性能优于传统的分块和节点多色排序方法，验证了该方法的有效性。
In this paper, we propose a new parallel ordering method to vectorize and parallelize the sparse triangular solver, which is called hierarchical block multi-color ordering. In this method, the parallel forward and backward substitutions can be vectorized while preserving the advantages of block multi-color ordering, that is, fast convergence and fewer thread synchronizations. To evaluate the proposed method in a parallel ICCG (Incomplete Cholesky Conjugate Gradient) solver, numerical tests were conducted using seven test matrices on three types of computational nodes. The numerical results indicate that the proposed method outperforms the conventional block and nodal multi-color ordering methods in 18 out of 21 test cases, which confirms the effectiveness of the method.