Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Grégoire PICHON"'
Publikováno v:
Future Generation Computer Systems
Future Generation Computer Systems, 2022, 130, pp.307-320. ⟨10.1016/j.future.2021.12.018⟩
[Research Report] RR-9368, INRIA. 2020
Future Generation Computer Systems, Elsevier, In press
Future Generation Computer Systems, 2022, 130, pp.307-320. ⟨10.1016/j.future.2021.12.018⟩
[Research Report] RR-9368, INRIA. 2020
Future Generation Computer Systems, Elsevier, In press
Sparse direct solvers using Block Low-Rank compression have been proven efficient to solve problems arising in many real-life applications. Improving those solvers is crucial for being able to 1) solve larger problems and 2) speed up computations. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63db4c7540f15de729501627227b184
https://doi.org/10.1016/j.future.2021.12.018
https://doi.org/10.1016/j.future.2021.12.018
Publikováno v:
MASCOTS 2021-29th IEEE International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
MASCOTS 2021-29th IEEE International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Nov 2021, Houston, United States. pp.1-8
MASCOTS
MASCOTS 2021-29th IEEE International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Nov 2021, Houston, United States. pp.1-8, ⟨10.1109/MASCOTS53633.2021.9614285⟩
MASCOTS 2021-29th IEEE International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Nov 2021, Houston, United States. pp.1-8
MASCOTS
MASCOTS 2021-29th IEEE International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Nov 2021, Houston, United States. pp.1-8, ⟨10.1109/MASCOTS53633.2021.9614285⟩
International audience; We present a simulator for High Performance Computing (HPC) interconnection networks. It models Portals 4, a standard low-level API for communication, and it allows running unmodified applications that use higher-level network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c5820be9c52dec9488a69e1633fc1a6
https://hal.inria.fr/hal-03366573/document
https://hal.inria.fr/hal-03366573/document
Autor:
Guillaume Sylvand, Mathieu Faverge, Enrique S. Quintana-Ortí, Grégoire Pichon, Rocío Carratalá-Sáez
Publikováno v:
IPDPS Workshops
In this paper, we describe and evaluate an extension of the Chameleon library to operate with hierarchical matrices (H-Matrices) and hierarchical arithmetic (H-Arithmetic), producing efficient solvers for linear systems arising in Boundary Element Me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ecbd096a2eb908f61ae574bcfd88f6b
https://doi.org/10.1109/ipdpsw50202.2020.00131
https://doi.org/10.1109/ipdpsw50202.2020.00131
Autor:
Pierre Ramet, Ali Al Zoobi, Grégoire Pichon, Anne Benoit, Mathieu Faverge, Changjiang Gou, Loris Marchal
Publikováno v:
Euro-Par 2020: Parallel Processing ISBN: 9783030576745
Euro-Par
Euro-Par
In order to express parallelism, parallel sparse direct solvers take advantage of the elimination tree to exhibit tree-shaped task graphs, where nodes represent computational tasks and edges represent data dependencies. One of the pre-processing stag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be7a71c95a10ca8f5c693e4a2155cced
https://doi.org/10.1007/978-3-030-57675-2_11
https://doi.org/10.1007/978-3-030-57675-2_11
Publikováno v:
International Journal of Computational Science and Engineering
International Journal of Computational Science and Engineering, Inderscience, 2018, 27, pp.255-270. ⟨10.1016/J.JOCS.2018.06.007⟩
International Journal of Computational Science and Engineering, 2018, 27, pp.255-270. ⟨10.1016/J.JOCS.2018.06.007⟩
International Journal of Computational Science and Engineering, Inderscience, 2018, 27, pp.255-270. ⟨10.1016/J.JOCS.2018.06.007⟩
International Journal of Computational Science and Engineering, 2018, 27, pp.255-270. ⟨10.1016/J.JOCS.2018.06.007⟩
International audience; This paper presents two approaches using a Block Low-Rank (BLR) compression technique to reduce the memory footprint and/or the time-to-solution of the sparse supernodal solver PaStiX. This flat, non-hierarchical, compression
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92aef672a2519f4ddb31452808f6b6ee
https://doi.org/10.1016/j.jocs.2018.06.007
https://doi.org/10.1016/j.jocs.2018.06.007
Publikováno v:
[Research Report] RR-9022, Inria Bordeaux Sud-Ouest. 2017, pp.24
18th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2017)
18th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2017), Jun 2017, Orlando, United States
IPDPS Workshops
18th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2017)
18th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2017), Jun 2017, Orlando, United States
IPDPS Workshops
International audience; This paper presents two approaches using a Block Low-Rank (BLR) compression technique to reduce the memory footprint and/or the time-to-solution of the sparse supernodal solver PaStiX. This flat, non-hierarchical, compression
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::529b74cbd70e860f86dabac70968f62b
https://hal.inria.fr/hal-01450732v3/document
https://hal.inria.fr/hal-01450732v3/document
Publikováno v:
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩
SIAM Journal on Matrix Analysis and Applications, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩
International audience; Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time-consuming and key kernel for those applications and for more advanced solvers such as hybrid direct-i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9647fbe7dd528abb106e5d44c768c7f4
https://inria.hal.science/hal-01485507v2/document
https://inria.hal.science/hal-01485507v2/document
Publikováno v:
IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015)
IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015), May 2015, Hyderabad, India
IPDPS
IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015), May 2015, Hyderabad, India
IPDPS
International audience; Computing eigenpairs of a symmetric matrix is a problem arising in many industrial applications, including quantum physics and finite-elements computation for automo-biles. A classical approach is to reduce the matrix to tridi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ee665d2cddaeab5dee6645097b0c4df
https://inria.hal.science/hal-01078356v3/document
https://inria.hal.science/hal-01078356v3/document
Autor:
UHRMACHER, ADELINDE M., FRAZIER, PETER, HÄHNLE, REINER, KLÜGL, FRANZISKA, LORIG, FABIAN, LUDÄSCHER, BERTRAM, NENZI, LAURA, RUIZ-MARTIN, CRISTINA, RUMPE, BERNHARD, SZABO, CLAUDIA, WAINER, GABRIEL, WILSDORF, PIA
Publikováno v:
ACM Transactions on Modeling & Computer Simulation; Oct2024, Vol. 34 Issue 4, p1-51, 51p
Autor:
CLAUS, LISA, GHYSELS, PIETER, LIU, YANG, NHAN, THAI ANH, THIRUMALAISAMY, RAMAKRISHNAN, BHALLA, AMNEET PAL SINGH, LI, SHERRY
Publikováno v:
ACM Transactions on Mathematical Software; Sep2023, Vol. 49 Issue 3, p1-28, 28p