We present parallel and sequential dense QR factorization algorithms that are both optimal
(up to polylogarithmic factors) in the amount of communication they perform and just as …

With the emergence of thread-level parallelism as the primary means for continued
performance improvement, the programmability issue has reemerged as an obstacle to the …

In a previous PPoPP paper we showed how the FLAME methodology, combined with the
SuperMatrix runtime system, yields a simple yet powerful solution for programming dense …

The promise of future many‐core processors, with hundreds of threads running concurrently,
has led the developers of linear algebra libraries to rethink their design in order to extract …

We present parallel and sequential dense QR factorization algorithms that are optimized to
avoid communication. Some of these are novel, and some extend earlier work …

We describe parallel implementations of LU factorization with pivoting for multicore
architectures. Implementations that differ in two different dimensions are discussed:(1) using …

We present parallel and sequential dense QR factorization algorithms that are both optimal
(up to polylogarithmic factors) in the amount of communication they perform, and just as …

We have invested heavily in hardware development but software tools and methods to use
the hardware continue to fall behind. The Sky is Falling. Panic is rampant. We respectfully …

In this PhD thesis, we study algorithms and implementations to accelerate the solution of
dense linear systems by using hybrid architectures with multicore processors and …

Las arquitecturas destinadas a computación de altas prestaciones (HPC) basadas en
aceleradores gráficos (GPUs) se han convertido en los últimos años en una alternativa …