20 citations · 44 across the 19 of their papers we have counts for
20 papers
Bidiagonalization with Parallel Tiled Algorithms
Mathieu Faverge, Julien Langou, Yves Robert +1
We consider algorithms for going from a "full" matrix to a condensed "band bidiagonal" form using orthogonal transformations. We use the framework of "algorithms by tiles". Within…
A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Method
Massimiliano Fasi, Julien Langou, Yves Robert +1
Several recent papers have introduced a periodic verification mechanism to detect silent errors in iterative solvers. Chen [PPoPP'13, pp. 167--176] has shown how to combine such a…
Designing LU-QR hybrid solvers for performance and stability
Mathieu Faverge, Julien Herrmann, Julien Langou +3
This paper introduces hybrid LU-QR al- gorithms for solving dense linear systems of the form Ax = b. Throughout a matrix factorization, these al- gorithms dynamically alternate LU…
On the Combination of Silent Error Detection and Checkpointing
Guillaume Aupy, Anne Benoit, Thomas Hérault +3
In this paper, we revisit traditional checkpointing and rollback recovery strategies, with a focus on silent data corruption errors. Contrarily to fail-stop failures, such latent e…
Optimal Checkpointing Period: Time vs. Energy
Guillaume Aupy, Anne Benoit, Thomas Hérault +2
This short paper deals with parallel scientific applications using non-blocking and periodic coordinated checkpointing to enforce resilience. We provide a model and detailed formul…
Co-Scheduling Algorithms for High-Throughput Workload Execution
Guillaume Aupy, Manu Shantharam, Anne Benoit +2
This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallel…