This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matrices distributed in a two-dimensional (2D) cyclic layout. The algorithm is based on a new pivoting strategy, referred to as ca-pivoting, that is shown to be stable in practice. The ca-pivoting strategy leads to a significant decrease in the number of messages exchanged during the factorization of a block-column relatively to conventional algorithms, and thus CALU overcomes the latency bottleneck of the LU factorization as in current implementations like ScaLAPACK and HPL. The experimental part of this paper focuses on the evaluation of the performance of CALU on two computational systems, an IBM POWER 5 system with 888 compute processors distr...
Cette thèse traite d une routine d algèbre linéaire largement utilisée pour la résolution des systèm...
The impact of the communication on the performance of numerical algorithms increases with the number...
Cette thèse traite d’une routine d’algèbre linéaire largement utilisée pour la résolution des systèm...
This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matri...
Abstract. Since the cost of communication (moving data) greatly exceeds the cost of doing arithmetic...
International audienceSince the cost of communication (moving data) greatly exceeds the cost of doin...
This dissertation focuses on a widely used linear algebra kernel to solve linear systems, that is th...
This paper presents some works on the LU factorization from the ScaLAPACK library. First, a complexi...
AbstractWe study several solvers for the solution of general linear systems where the main objective...
We study several solvers for the solution of general linear systems where the main objective is to r...
The solution of dense systems of linear equations is at the heart of numerical computations. Such sy...
In this paper, we make efficient use of asynchronous communications on the LU decomposition algorit...
We present an out-of-core sparse nonsymmetric LU-factorization algorithm with partial pivoting. We h...
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory...
The impact of the communication on the performance of numerical algorithms increases with the number...
Cette thèse traite d une routine d algèbre linéaire largement utilisée pour la résolution des systèm...
The impact of the communication on the performance of numerical algorithms increases with the number...
Cette thèse traite d’une routine d’algèbre linéaire largement utilisée pour la résolution des systèm...
This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matri...
Abstract. Since the cost of communication (moving data) greatly exceeds the cost of doing arithmetic...
International audienceSince the cost of communication (moving data) greatly exceeds the cost of doin...
This dissertation focuses on a widely used linear algebra kernel to solve linear systems, that is th...
This paper presents some works on the LU factorization from the ScaLAPACK library. First, a complexi...
AbstractWe study several solvers for the solution of general linear systems where the main objective...
We study several solvers for the solution of general linear systems where the main objective is to r...
The solution of dense systems of linear equations is at the heart of numerical computations. Such sy...
In this paper, we make efficient use of asynchronous communications on the LU decomposition algorit...
We present an out-of-core sparse nonsymmetric LU-factorization algorithm with partial pivoting. We h...
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory...
The impact of the communication on the performance of numerical algorithms increases with the number...
Cette thèse traite d une routine d algèbre linéaire largement utilisée pour la résolution des systèm...
The impact of the communication on the performance of numerical algorithms increases with the number...
Cette thèse traite d’une routine d’algèbre linéaire largement utilisée pour la résolution des systèm...