کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11002663 | 1446733 | 2018 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Self-stabilizing fine-grained parallel incomplete LU factorization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Self-stabilizing fine-grained parallel incomplete LU factorization Self-stabilizing fine-grained parallel incomplete LU factorization](/preview/png/11002663.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Sustainable Computing: Informatics and Systems - Volume 19, September 2018, Pages 291-304
Journal: Sustainable Computing: Informatics and Systems - Volume 19, September 2018, Pages 291-304
نویسندگان
Evan Coleman, Masha Sosonkina,