.png){kind=icon}
.png){kind=icon}
Return
Self-stabilizing fine-grained parallel incomplete LU factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.suscom.2018.01.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an investigation into the use of various mechanisms for improving the resilience of the fine-grained parallel algorithm for computing an incomplete LU factorization. These include various approaches to checkpointing as well as a study into the feasibility of using a self-stabilizing periodic correction step. Results concerning convergence of all of the self-stabilizing variants of the algorithm with respect to the occurrence of faults, and the impact of any sub-optimality in the produced incomplete L and U factors in Krylov subspace solvers are given. Numerical tests show that the simple algorithmic changes suggested here can ensure convergence of the fine-grained parallel incomplete factorization, and improve the performance of the resulting factors as preconditioners in Krylov subspace solvers in the presence of transient soft faults. Published by Elsevier Inc.
Keywords:
Fault tolerance
Parallel preconditioning
Incomplete factorization
Asynchronous iterative methods
Self-stabilizing iterative algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
5.7
Papers:
966
Citations:
2.9K