Emmanuel Agullo

Orcid: 0000-0003-0655-6934

According to our database1, Emmanuel Agullo authored at least 53 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Multifacets of lossy compression for scientific data in the Joint-Laboratory of Extreme Scale Computing.
Future Gener. Comput. Syst., 2025

2023
Task-based Parallel Programming for Scalable Matrix Product Algorithms.
ACM Trans. Math. Softw., June, 2023

On the Arithmetic Intensity of Distributed-Memory Dense Matrix Multiplication Involving a Symmetric Input Matrix (SYMM).
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022
Resiliency in numerical algorithm design for extreme scale simulations.
Int. J. High Perform. Comput. Appl., 2022

Study of the Processor and Memory Power and Energy Consumption of Coupled Sparse/Dense Solvers.
Proceedings of the 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2022

Decentralized in-order execution of a sequential task-based code for shared-memory architectures.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

Direct solution of larger coupled sparse/dense linear systems using low-rank compression on single-node multi-core machines in an industrial context.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2020
On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection.
SIAM J. Sci. Comput., 2020

2019
Robust Preconditioners via Generalized Eigenproblems for Hybrid Sparse Linear Solvers.
SIAM J. Matrix Anal. Appl., 2019

Energy Analysis of a Solver Stack for Frequency-Domain Electromagnetics.
Proceedings of the 27th Euromicro International Conference on Parallel, 2019

On the Autotuning of Task-Based Numerical Libraries for Heterogeneous Architectures.
Proceedings of the Parallel Computing: Technology Trends, 2019

2018
Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method.
SIAM J. Matrix Anal. Appl., 2018

Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices.
SIAM J. Matrix Anal. Appl., 2018

Special issue on parallel matrix algorithms and applications (PMAA'16).
Parallel Comput., 2018

2017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method.
IEEE Trans. Parallel Distributed Syst., 2017

2016
Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems.
ACM Trans. Math. Softw., 2016

Interpolation-Restart Strategies for Resilient Eigensolvers.
SIAM J. Sci. Comput., 2016

Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations.
SIAM J. Sci. Comput., 2016

Numerical recovery strategies for parallel resilient Krylov linear solvers.
Numer. Linear Algebra Appl., 2016

Task-based FMM for heterogeneous architectures.
Concurr. Comput. Pract. Exp., 2016

Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2016, 2016

Are Static Schedules so Bad? A Case Study on Cholesky Factorization.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Task-Based Sparse Hybrid Linear Solver for Distributed Memory Heterogeneous Architectures.
Proceedings of the Euro-Par 2016: Parallel Processing Workshops, 2016

Task-Based Conjugate Gradient: From Multi-GPU Towards Heterogeneous Architectures.
Proceedings of the Euro-Par 2016: Parallel Processing Workshops, 2016

Exploiting a Parametrized Task Graph Model for the Parallelization of a Sparse Direct Multifrontal Solver.
Proceedings of the Euro-Par 2016: Parallel Processing Workshops, 2016

On rounding error resilience, maximal attainable accuracy and parallel performance of the pipelined Conjugate Gradients method for large-scale linear systems in PETSc.
Proceedings of the Exascale Applications and Software Conference 2016, 2016

2015
Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Fast and Accurate Simulation of Multithreaded Sparse Linear Algebra Solvers.
Proceedings of the 21st IEEE International Conference on Parallel and Distributed Systems, 2015

On the Resilience of Parallel Sparse Hybrid Solvers.
Proceedings of the 22nd IEEE International Conference on High Performance Computing, 2015

Task-Based Multifrontal QR Solver for GPU-Accelerated Multicore Architectures.
Proceedings of the 22nd IEEE International Conference on High Performance Computing, 2015

2014
Task-Based FMM for Multicore Architectures.
SIAM J. Sci. Comput., 2014

Block GMRES Method with Inexact Breakdowns and Deflated Restarting.
SIAM J. Matrix Anal. Appl., 2014

Task-Based Programming for Seismic Imaging: Preliminary Results.
Proceedings of the 2014 IEEE International Conference on High Performance Computing and Communications, 2014

2013
Parallel algebraic domain decomposition solver for the solution of augmented systems.
Adv. Eng. Softw., 2013

Multifrontal QR Factorization for Multicore Architectures over Runtime Systems.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012
Pipelining the Fast Multipole Method over a Runtime System
CoRR, 2012



2011
QCG-OMPI: MPI applications on grids.
Future Gener. Comput. Syst., 2011

Fully Empirical Autotuned QR Factorization For Multicore Architectures
CoRR, 2011

QR Factorization on a Multicore Node Enhanced with Multiple GPU Accelerators.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

LU factorization for accelerator-based systems.
Proceedings of the 9th IEEE/ACS International Conference on Computer Systems and Applications, 2011

2010
Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods.
SIAM J. Sci. Comput., 2010

Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2010, 2010

Tile QR factorization with parallel panel processing for multicore architectures.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

QR factorization of tall and skinny matrices in a grid computing environment.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Comparative study of one-sided factorizations with multiple software packages on multi-core hardware.
Proceedings of the ACM/IEEE Conference on High Performance Computing, 2009

2008
On the Out-Of-Core Factorization of Large Sparse Matrices. (Méthodes directes hors-mémoire (out-of-core) pour la résolution de systèmes linéaires creux de grande taille).
PhD thesis, 2008

A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory.
Parallel Comput., 2008

On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme.
Proceedings of the High Performance Computing for Computational Science, 2008

2007
Reducing the I/O Volume in an Out-of-Core Sparse Multifrontal Solver.
Proceedings of the High Performance Computing, 2007

2006
A Preliminary Out-of-Core Extension of a Parallel Multifrontal Solver.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006


  Loading...