ParILUT
ParILUT - A Parallel Threshold ILU for GPUs. architectures. The proposed ParILUT-GPU algorithm is based on interleaving parallel fixed-point iterations that approximate the incomplete factors for an existing nonzero pattern with a strategy that dynamically adapts the nonzero pattern to the problem characteristics. This requires the efficient selection of thresholds that separate the values to be dropped from the incomplete factors, and we design a novel selection algorithm tailored towards GPUs. All components of the ParILUT-GPU algorithm make heavy use of the features available in the latest NVIDIA GPU generations, and outperform existing multithreaded CPU implementations.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
Sorted by year (- Anzt, Hartwig; Cojean, Terry; Flegar, Goran; Göbel, Fritz; Grützmacher, Thomas; Nayak, Pratik; Ribizel, Tobias; Tsai, Yuhsiang Mike; Quintana-Ortí, Enrique S.: \textscGinkgo: a modern linear operator algebra framework for high performance computing (2022)
- Chen, Chao; Liang, Tianyu; Biros, George: \textttrchol: randomized Cholesky factorization for solving SDD linear systems (2021)
- Kashi, Aditya; Nadarajah, Sivakumaran: An asynchronous incomplete block LU preconditioner for computational fluid dynamics on unstructured grids (2021)
- Hartwig Anzt, Terry Cojean, Yen-Chen Chen, Goran Flegar, Fritz Göbel, Thomas Grützmacher, Pratik Nayak, Tobias Ribizel, Yu-Hsiang Tsai: Ginkgo: A high performance numerical linear algebra library (2020) not zbMATH
- Anzt, Hartwig; Chow, Edmond; Dongarra, Jack: ParILUT -- a new parallel threshold ILU factorization (2018)