Scalable, Robust, Fault-Tolerant Parallel QR Factorization
Camille Coti · 2016
In this paper, we are presenting QR factorization algorithms that can tolerate process crashes and soft errors (bit flips). Our algorithms take advantage of structural properties of a QR factorization algorithm referred to as "communication-avoiding". We show that, exploiting these properties, our resilient, robust algorithms modify the communication pattern of the computation but do not add any significant computation in the critical path.