Fault Tolerant High Performance Solver for Linear Equation Systems

被引:2
作者
Artioli, Marcello [1 ]
Loreti, Daniela [2 ]
Ciampolini, Anna [2 ]
机构
[1] ENEA, Bologna Res Ctr, Bologna, Italy
[2] Univ Bologna, DISI, Bologna, Italy
来源
2019 IEEE 38TH INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2019) | 2019年
关键词
fault tolerance; High Performance Computing; algebraic linear systems; Inhibition Method; LARGE-SCALE; IME;
D O I
10.1109/SRDS47363.2019.00022
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The ever-increasing size of High Performance Computing (HPC) systems inevitably causes an unwanted decrease of Mean Time Between Failures (MTBF). For this reason, over the last decade, much work has been done on the topic of fault tolerance for supercomputers. In particular, as large-scale linear algebra applications permeate many scientific fields, important efforts have been focused on the performance enhancements that could be provided by HPC infrastructures if reliable fault tolerant solutions are adopted. This article explores a popular topic of linear algebra (i.e., linear equation system resolution) and proposes an efficient, error-resilient approach based on an existing technique called Inhibition Method (IMe). Initially conceived to analyse complex electric circuits and later extended to solve linear systems, the original method is here enhanced with a simple, yet effective strategy to provide tolerance to single fail-stop recurring to neither checkpointing, nor rollbacks. Experimental results on a medium-scale HPC architecture show negligible overheads and promising performance improvements when compared with a popular fault-tolerant solving technique.
引用
收藏
页码:113 / 122
页数:10
相关论文
共 64 条
[41]   IMe: 4-term formula method for the symbolic analysis of linear circuits [J].
Filippetti, F ;
Artioli, M .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2004, 51 (03) :526-538
[42]   A condensation-based application of Cramer's rule for solving large-scale linear systems [J].
Habgood, Ken ;
Arel, Itamar .
JOURNAL OF DISCRETE ALGORITHMS, 2012, 10 (01) :98-109
[43]   A Guide for Achieving High Performance with Very Small Matrices on GPU: A Case Study of Batched LU and Cholesky Factorizations [J].
Haidar, Azzam ;
Abdelfattah, Ahmad ;
Zounon, Mawussi ;
Tomov, Stanimire ;
Dongarra, Jack .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (05) :973-984
[44]   Fail-Stop Failure Algorithm-Based Fault Tolerance for Cholesky Decomposition [J].
Hakkarinen, Doug ;
Wu, Panruo ;
Chen, Zizhong .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (05) :1323-1335
[45]  
Herault T, 2015, COMPUT COMMUN NETW S, P1, DOI 10.1007/978-3-319-20943-2
[46]   ALGORITHM-BASED FAULT TOLERANCE FOR MATRIX OPERATIONS [J].
HUANG, KH ;
ABRAHAM, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (06) :518-528
[47]   Hessenberg Reduction with Transient Error Resilience on GPU-Based Hybrid Architectures [J].
Jia, Yulu ;
Luszczek, Piotr ;
Dongarra, Jack .
2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, :653-662
[48]   The soft error problem: An architectural perspective [J].
Mukherjee, SS ;
Emer, J ;
Reinhardt, SK .
11TH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, :243-247
[49]   High-performance and Memory-saving Sparse General Matrix-Matrix Multiplication for NVIDIA Pascal GPU [J].
Nagasaka, Yusuke ;
Nukada, Akira ;
Matsuoka, Satoshi .
2017 46TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2017, :101-110
[50]  
Nie B, 2018, 2018 51ST ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO), P749, DOI [10.1109/MICRO.2018.00066, 10.1109/MICR0.2018.00066]