Emmanuel Agullo (CONCACE)

I am strongly involved in the guix-hpc initiative to ensure robust of deployment of scientific sofware on modern supercomputers, an important concern for reproducibility in HPC.

I'm developping and maintaining a tentative set up for research and development in scientific computing. This setup consists in an elementary coupling between guix and emacs. This is the elementaryx project.

maphys++ is the successor of maphys. It is a complete redesign based on the mathematical results of Louis Poirel's PhD thessis showing how to design composable Abstact Schwarz methods.

I have co-supervised its design and development. Most of the actual software development was done by Gilles Marait.

chameleon was born in the context of the Matrices Over Runtime Systems (MORSE) Associate Team (see The Chameleon solver is born). It proved that we can write dense linear algebra algorithms and software at a high level with respect to the architecture. This abstraction allowed to join the respective expertise of researchers in linear algebra with that of researchers in runtime systems and scheduling. The key abstraction was the design of HPC numerical algorithms as a Directed Acyclic Graph (DAG) of tasks.

I used to be the leader of the project, as well as one of the main developers and maintainers, especially in the first years. This project has since attracted much more attention and most of the maintenance is now ensured by colleagues from topal and sed, especially Mathieu Faverge and Florent Pruvost, respectively.

qr_mumps is a software package for the solution of sparse, linear systems on multicore computers. It implements a direct solution method based on the QR factorization of the input matrix. The qr_mumps project is led by Alfredo Buttari (IRIT).

After we got success in expressing dense linear algebra algorithms at a high-level of expression through task-based programming, we decided to investigate whether we could do so with more irregular algorithms, such as the factorization of sparse matrices.

My main contribution to the project has been the help to its task-based design. Most of this joint work was done in the context of the ANR MN SOLvers for Heterogeneous Architectures over Runtime systems (SOLHAR) and ANR PRCE SOLvers for Heterogeneous Architectures over Runtime systems, Investigating Scalability (SOLHARIS) projects.

scalfmm is a C++ library that implements a kernel independent Fast Multipole Method (FMM). The scalfmm project is led by Olivier Coulaud.

After the success of the early developments of Matrices Over Runtime Systems (MORSE) Associate Team and of the design of the prototype of what would become chameleon, the Fast and Scalable Hierarchical Algorithms for Computational Linear Algebra (FastLA) Associate Team was started to develop fast and scalable hierarchical algorithms. The research of both associated teams was strongly connected, especially regarding the design of task-based algorithms. It was decided to develop a task-based version of the FMM.

My main contribution to the scalfmm project has been the help to its task-based design. Most of this joint work was done in the context of the Fast and Scalable Hierarchical Algorithms for Computational Linear Algebra (FastLA) Associate Team.

• Nick Schenkels, December 2018 - December 2020, co-advised with Luc Giraud and Franck Cappello (Argonne National Laboratory (ANL))
• Cristóbal Samaniego Alvarado, December 2017 - April 2019, co-advised with Luc Giraud and Stephane Lanteri (atlantis)
• Ian Masliah, November 2016 - April 2018, co-advised with Alfredo Buttari (IRIT) and Abdou Guermouche
• Matthieu Kuhn, January 2015 - April 2018, co-advised with Luc Giraud and Stephane Lanteri (atlantis)
• Luka Stanisic, 2015 - 2017, co-advised with Samuel Thibault (storm)
• Yuval Harness, December 2014 - June 2017, Fast and Scalable Hierarchical Algorithms for Computational Linear Algebra (FastLA) Associate Team, co-advised with Eric Darve (Stanford University) and Luc Giraud
• Emrullah Fatih Yetkin, March 2014 - August 2016, co-advised with Luc Giraud

• Antoine Jego, Advanced task-based programming models for scalable linear algebra operations, 2023, co-advisor (33%, with Alfredo Buttari (IRIT) and Abdou Guermouche), emditt
• Romain Peressoni, Large Scale Multidimensional Scaling for the Study of Biodiversity, 2023, co-director (33%, with Olivier Coulaud and Alain Franc), edmi ub
• Marek Felsoci, Fast solvers for high-frequency aeroacoustics, 2023, co-advisor (33%, with Luc Giraud Guillaume Sylvand), edmi ub
• Aurélien Falco, Bridging the Gap Between H-Matrices and Sparse Direct Methods for the Solution of Large Linear Systems, 2019, co-advisor (33%, with Luc Giraud and Guillaume Sylvand), edmi ub
• Louis Poirel, Algebraic Domain Decomposition Methods for Hybrid (direct/iterative) Solvers, 2018, co-director (50%, with Luc Giraud), edmi ub
• Suraj Kumar, Scheduling of Dense Linear Algebra Kernels on Heterogeneous Resources, 2017, co-advisor (25%, with Olivier Beaumont, Lionel Eyraud-Dubois and Samuel Thibault), edmi ub
• Stojce Nakov, On the design of sparse hybrid linear solvers for modern parallel architectures, 2015, co-director (33%, with Luc Giraud and Jean Roman), edmi ub
• Florent Lopez, Task-based multifrontal QR solver for heterogeneous architectures, 2015, co-advisor (33%, with Alfredo Buttari (IRIT) and Abdou Guermouche), emditt
• Mawussi Zounon, On numerical resilience in linear algebra, 2015, co-director (33%, with Luc Giraud and Jean Roman), edmi ub

• Cédric Castagnède
• Matthieu Lecouvez
• Yohan Lee-Tin-Yien
• Gilles Marait
• Julien Pedron
• Florent Pruvost

• ICPP 2022, held virtually, Multidisciplinary Track Committee Member (new committee)
• IPDPS'22, held virtually, System Software Track Member
• IPDPS'21, held virtually, System Software Track Member
• ISC 2021, held virtually, Workshops Committee Member
• ISC 2020, held virtually, Workshops Committee Member
• SC19, Denver (Colorado), USA, Algorithms Track Member
• ICPP 2018, Eugene (Oregon), USA, Algorithms Track Member
• PMAA'18, Zurich, Switzerland, Program Committee Member
• SC17, Denver (Colorado), USA, Algorithms Track Member
• SC16, Salt Lake City (Utah), USA, Algorithms Track Member
• IPDPS'14, Phoenix (Arizona), USA, Algorithms Track Member
• PMAA'14, Lugano, Switzerland, Program Committee Member
• IPDPS'13, Boston (Massachusetts), USA, Algorithms Track Member
• PMAA'12, London, UK, Program Committee Member
• PMAA'10, Basel, Switzerland, Program Committee Member

• 2018, Special issue on parallel matrix algorithms and applications (PMAA’16), Parallel Computing

• 2022-…: Member of the Commission de Développement Technologique (CDT) @ Inria Centre at the University of Bordeaux (intranet)
• 2016-…: Member of the LaBRI Commission Appels à Projets (head: Marc Zeitoun)
• 2015-2021: Inria Centre at the University of Bordeaux Scientific Correspondent for the Inria Director of European Partnerships
• 2010-2021: Member of the Commission des Moyens Informatiques - Recherche (CUMI-R) @ Inria Centre at the University of Bordeaux (hiepacs representatitve)
• 2017: Member of the Isabelle Attali Prize Jury
• 2016: Member of the Isabelle Attali Prize Jury
• 2016: Member of the Eligibility Jury for Researchers @ Inria Centre at the University of Bordeaux (membre du jury d'admissibilité du concours chargé de recherche)
• 2014: Member of the Eligibility Jury for Researchers @ Inria Centre at the University of Bordeaux (membre du jury d'admissibilité du concours chargé de recherche)
• 2006-2008: Member of the LIP laboratory council at ENS Lyon

• 2010-2022: In charge of hiepacs Working Groups
• 2005-2008: In charge of graal (predecessor of roma and avalon @ LIP) Working Groups

Typical yearly teaching:

• Operating systems (24h), M1, Bordeaux University;
• High-performance numerical linear algebra (8h), 3A, Enseirb;
• Numerical algorithms (20h), 1A, Enseirb.

• 2022: Algèbre linéaire numérique et parallèle pour l'analyse de données @ Rencontres annuelles 2022 Réseau Mexico, INRAE Cestas Gazinet (France)

• 2023: Reconciling high-performance computing with the use of third-party libraries? (video) @ The First Workshop on Reproducible Software Environments for Research and High-Performance Computing, Montpellier, France
• 2021: Resiliency in Numerical Algorithm Design for Extreme Scale Simulations Dagstuhl Seminar @ Dagstuhl, Germany
• 2019: Parallel Solution Methods for Systems Arising from PDEs @ CIRM, Marseille, France (slides)
• 2017: 9èmes Rencontres «Arithmétique de l'Informatique Mathématique» (RAIM 2017) @ ENS Lyon, France (slides)
• 2010: 4th ''Scheduling in Aussois'' Workshop, Aussois (France)

• Toulouse INP Léopold Escande Prize 2023 (to appear) for Antoine Jego's PhD (co-advisor)
• IEEE AICCSA 2011 Best Paper Award
• Vecpar 2010 Best Student (Henricus Bouwmeester) Paper Award