- 8
Pierre Ramet
Pierre RAMET - Responsable du département SATANAS (Supports et Algorithms pour les Applications Numériques Hautes Performances)
8
Documents
Affiliations actuelles
- 259761
- 104751
- 3102
- 440172
- 1124391
Identifiants chercheurs
pierre-ramet- IdRef : 189029668
-
0000-0002-6179-9819
Présentation
Ma problématique de recherche concerne les problèmes du calcul haute performance, en particulier l'algèbre linéaire creuse. Je développe la bibliothèque PaStiX ([https://solverstack.gitlabpages.inria.fr/pastix](https://solverstack.gitlabpages.inria.fr/pastix "PaStiX")) qui implémente un solveur direct creux haute performance.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
My interests span high-performance computing, focusing on sparse linear algebra. I am the developer of PaStiX ([https://solverstack.gitlabpages.inria.fr/pastix](https://solverstack.gitlabpages.inria.fr/pastix "PaStiX")), a high-performance sparse direct solver.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Domaines de recherche
Informatique [cs]
Analyse numérique [math.NA]
Compétences
Sparse Linear Algebra
Parallel Algorithms
Scientific Computing
Publications
- 4
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 7
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 5
- 2
- 1
- 8
- 5
- 8
|
|
Reordering Strategy for Blocking Optimization in Sparse Linear SolversSIAM Journal on Matrix Analysis and Applications, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226 - 248. ⟨10.1137/16M1062454⟩
Article dans une revue
hal-01485507v2
|
Exploiting Modern Manycore Architecture in Sparse Direct Solver with Runtime SystemsSIAM Conference on Computation Science and Engineering (CSE'17), Feb 2017, Atlanta, United States
Communication dans un congrès
hal-01421383v1
|
|
Impact of Blocking Strategies for Sparse Direct Solvers on Top of Generic RuntimesSIAM Conference on Computation Science and Engineering (CSE'17), Feb 2017, Atlanta, United States
Communication dans un congrès
hal-01421384v1
|
|
|
|
Sparse Supernodal Solver Using Block Low-Rank Compression18th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2017), Jun 2017, Orlando, United States
Communication dans un congrès
hal-01502215v1
|
Sparse Supernodal Solver Using Hierarchical Compression over Runtime SystemSIAM Conference on Computation Science and Engineering (CSE'17), Feb 2017, Atlanta, United States
Communication dans un congrès
hal-01421379v1
|
|
Exploiting Kepler architecture in sparse direct solver with runtime systems9th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'2016), Jul 2016, Bordeaux, France
Communication dans un congrès
hal-01421372v1
|
|
|
|
Taking advantage of hybrid systems for sparse direct solvers via task-based runtimesHCW'2014 workshop of IPDPS, May 2014, Phoenix, United States. pp.29-38, ⟨10.1109/IPDPSW.2014.9⟩
Communication dans un congrès
hal-00987094v1
|
|
|
Reordering strategy for blocking optimization in sparse linear solvers[Research Report] RR-8860, Inria Bordeaux Sud-Ouest; LaBRI - Laboratoire Bordelais de Recherche en Informatique; Bordeaux INP; Université de Bordeaux. 2016, pp.26
Rapport
hal-01276746v2
|