206 citations · 805 across the 35 of their papers we have counts for
6 papers · 1 filter
I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels
Olivier Beaumont, Lionel Eyraud-Dubois, Mathieu Vérité +1
In this paper, we consider two fundamental symmetric kernels in linear algebra: the Cholesky factorization and the symmetric rank- update (SYRK), with the classical three nested…
A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling
Willy Quach, Julien Langou
Due to the advent of multicore architectures and massive parallelism, the tiled Cholesky factorization algorithm has recently received plenty of attention and is often referenced b…
A Greedy Algorithm for Optimally Pipelining a Reduction
Bradley R. Lowery, Julien Langou
Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be…
Hierarchical QR factorization algorithms for multi-core cluster systems
Jack Dongarra, Mathieu Faverge, Thomas Herault +2
This paper describes a new QR factorization algorithm which is especially designed for massively parallel platforms combining parallel distributed multi-core nodes. These platforms…
A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion
Henricus Bouwmeester, Julien Langou
Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants offer a wide spectrum of perform…
Algorithmic Based Fault Tolerance Applied to High Performance Computing
George Bosilca, Remi Delmas, Jack Dongarra +1
We present a new approach to fault tolerance for High Performance Computing system. Our approach is based on a careful adaptation of the Algorithmic Based Fault Tolerance technique…