Add to ORKG• Selected past work on reducing communication • Communication complexity of linear algebra operations • Communication avoiding for dense linear algebra • LU, QR, Rank Revealing QR factorizations • Progressively implemented in ScaLAPACK and LAPACK • Algorithms for multicore processor
This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexi...
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory...
This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matri...
This study focuses on the performance of two classical dense linear algebra algorithms, the LU and t...
In this paper we study the performance of two classical dense linear algebra algorithms, the LU and ...
International audienceWe present parallel and sequential dense QR factorization algorithms that are ...
Dense linear algebra computations are essential to nearly every problem in scientific computing and ...
International audienceModern, massively parallel computers play a fundamental role in a large and ra...
This paper presents some works on the LU factorization from the ScaLAPACK library. First, a complexi...
Abstract—To efficiently scale dense linear algebra problems to future exascale systems, communicatio...
This dissertation focuses on a widely used linear algebra kernel to solve linear systems, that is th...
To efficiently scale dense linear algebra problems to future exascale systems, communication cost mu...
The solution of dense systems of linear equations is at the heart of numerical computations. Such sy...
There is a growing performance gap between computation and communication on modern computers, making...
This paper discusses the scalability of Cholesky, LU, and QR factorization routines on MIMD distribu...
This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexi...
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory...
This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matri...
This study focuses on the performance of two classical dense linear algebra algorithms, the LU and t...
In this paper we study the performance of two classical dense linear algebra algorithms, the LU and ...
International audienceWe present parallel and sequential dense QR factorization algorithms that are ...
Dense linear algebra computations are essential to nearly every problem in scientific computing and ...
International audienceModern, massively parallel computers play a fundamental role in a large and ra...
This paper presents some works on the LU factorization from the ScaLAPACK library. First, a complexi...
Abstract—To efficiently scale dense linear algebra problems to future exascale systems, communicatio...
This dissertation focuses on a widely used linear algebra kernel to solve linear systems, that is th...
To efficiently scale dense linear algebra problems to future exascale systems, communication cost mu...
The solution of dense systems of linear equations is at the heart of numerical computations. Such sy...
There is a growing performance gap between computation and communication on modern computers, making...
This paper discusses the scalability of Cholesky, LU, and QR factorization routines on MIMD distribu...
This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexi...
Due to the evolution of massively parallel computers towards deeper levels of parallelism and memory...
This paper presents CALU, a Communication Avoiding algorithm for the LU factorization of dense matri...