Zobrazeno 1 - 10 of 43 pro vyhledávání: '"Pichon, Grégoire"'
1
Akademický článek
RED-SEA Project: Towards a new-generation European interconnect
Autor: Gomez, Maria Engracia, Sahuquillo, Julio, Biagioni, Andrea, Chrysos, Nikos, Berton, Damien, Frezza, Ottorino, Lo Cicero, Francesca, Lonardo, Alessandro, Martinelli, Michele, Paolucci, Pier Stanislao, Pastorelli, Elena, Simula, Francesco, Turisini, Matteo, Vicini, Piero, Ammendola, Roberto, Chiarini, Carlotta, De Luca, Chiara, Capuani, Fabrizio, Castelló, Adrián, Duro, Jose, Stabile, Eugenio, Quintana, Enrique, Bernier-Bruna, Pascale, Chen, Claire, Lagadec, Pierre-Axel, Pichon, Gregoire, Walter, Etienne, Katevenis, Manolis, Bartzis, Sokratis, Mousouros, Orestis, Xirouchakis, Pantelis, Mageiropoulos, Vangelis, Gianioudis, Michalis, Loukas, Harisis, Ioannou, Aggelos, Kallimanis, Nikos, de la Rosa, Miguel Sanchez, Gomez-Lopez, Gabriel, Alfaro-Cortés, Francisco, Sahuquillo, Jesus Escudero, Garcia, Pedro Javier, Quiles, Francisco J., Sanchez, Jose L., De Gassowski, Gaetan, Hautreaux, Matthieu, Mathieu, Stephane, Moreau, Gilles, Perache, Marc, Taboada, Hugo, Hoefler, Torsten, Schneider, Timo, Barnaba, Matteo, Brandino, Giuseppe Piero, De Giorgi, Francesco, Poggi, Matteo, Mavroidis, Iakovos, Papaefstathiou, Yannis, Tampouratzis, Nikolaos, Kalisch, Benjamin, Krackhardt, Ulrich, Nuessle, Mondrian, Frings, Wolfang, Gottwald, Dominik, Guimaraes, Felime, Holicki, Max, Marx, Volker, Muller, Yannik, Clauss, Carsten, Falter, Hugo, Huang, Xu, Barillao, Jennifer Lopez, Moschny, Thomas, Pickartz, Simon
Publikováno v: In Microprocessors and Microsystems October 2024 110
Zobrazit plný text záznamu
2
Dissertation/ Thesis
On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques
Autor: Pichon, Grégoire
La résolution de systèmes linéaires creux est un problème qui apparaît dans de nombreuses applications scientifiques, et les solveurs creux sont une étape coûteuse pour ces applications ainsi que pour des solveurs plus avancés comme les solve
Externí odkaz: http://www.theses.fr/2018BORD0249/document
Zobrazit plný text záznamu
3
Akademický článek
Trading performance for memory in sparse direct solvers using low-rank compression
Autor: Marchal, Loris, Marette, Thibault, Pichon, Grégoire, Vivien, Frédéric
Publikováno v: In Future Generation Computer Systems May 2022 130:307-320
Zobrazit plný text záznamu
4
Engineering fast algorithms for the bottleneck matching problem
Autor: Panagiotas, Ioannis, Pichon, Grégoire, Singh, Somesh, Uçar, Bora
Publikováno v: ESA 2023-The 31st Annual European Symposium on Algorithms
ESA 2023-The 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam (Hollande), Netherlands
International audience; We investigate the maximum bottleneck matching problem in bipartite graphs. Given a bipartite graph with nonnegative edge weights, the problem is to determine a maximum cardinality matching in which the minimum weight of an ed
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::002eeef63bf71a6021107d97ef9c06ba
https://inria.hal.science/hal-04146298
Zobrazit plný text záznamu
5
D2.3 RoCE and IPoverBXI Evaluation Report
Autor: Saloustros, Giorgos, Kallimanis, Nikolaos D., Chrysos, Nikolaos, Espié Caullet, Jonathan, Goudeau, Sylvain, Pichon , Grégoire
In the RED-SEA project, we study new interconnect technologies built around BXI. Designing new solutions for RDMA interconnects, it is important to know the performance levels of existing solutions. Beside raw performance numbers, it is important to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d14f8c523eb3d6d423cfb67cd6adb217
Zobrazit plný text záznamu
6
Atteindre la qualité d’une SVD avec une compression de rang faible pour différentes variantes de la factorisation QR
Autor: Korkmaz, Esragul, Faverge, Mathieu, Pichon, Grégoire, Ramet, Pierre
Publikováno v: [Research Report] RR-9476, Inria Bordeaux-Sud Ouest. 2022, pp.43
Solving linear equations of type $Ax=b$ for large sparse systems frequently emerges in science/engineering applications, which is the main bottleneck. In spite that the direct methods are costly in time and memory consumption, they are still the most
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c22b109dedaf4cda5ec64ec8b14d70b9
https://inria.hal.science/hal-03718312
Zobrazit plný text záznamu
7
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization
Autor: Korkmaz, Esragul, Faverge, Mathieu, Pichon, Grégoire, Ramet, Pierre
Publikováno v: HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics
HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10
[Research Report] RR-9396, Inria Bordeaux-Sud Ouest. 2021, pp.16
HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10, ⟨10.1109/HiPC53243.2021.00024⟩
Low-rank compression techniques are very promising for reducing memory footprintand execution time on a large spectrum of linear solvers. Sparse direct supernodal approaches areone these techniques. However, despite providing a very good scalability
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::241de7fa5f24321a04277461a9937b66
https://hal.inria.fr/hal-03152932v2
Zobrazit plný text záznamu
8
Simulation of the Portals 4 protocol, and case study on the BXI interconnect
Autor: Emmanuel, Julien, Moy, Matthieu, Henrio, Ludovic, Pichon, Grégoire
Publikováno v: HPCS 2020-International Conference on High Performance Computing & Simulation
HPCS 2020-International Conference on High Performance Computing & Simulation, Dec 2020, Barcelona, Spain. pp.1-8
International audience; We present a new network simulator, which models the Portals 4 communication protocol used in High Performance Computing (HPC). It is built on top of SimGrid and uses cooperative actors to model the interactions between comput
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5ee8d41da788bd2c55cd7805d2cdce6e
https://hal.archives-ouvertes.fr/hal-02972297/document
Zobrazit plný text záznamu
9
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing
Autor: Gou, Changjiang, Al Zoobi, Ali, Benoit, Anne, Faverge, Mathieu, Marchal, Loris, Pichon, Grégoire, Ramet, Pierre
Publikováno v: EuroPar 2020-26th International European Conference on Parallel and Distributed Computing
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
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=dedup_wf_001::84d2600c7a50648cd9e61b117ea6aae0
https://inria.hal.science/hal-02973315/file/paper.pdf
Zobrazit plný text záznamu
10
Tiled Algorithms for Efficient Task-Parallel H-Matrix Solvers
Autor: Carratalá-Sáez, Rocío, Faverge, Mathieu, Pichon, Grégoire, Sylvand, Guillaume, Quintana-Ortí, Enrique
Publikováno v: 21st IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2020)
21st IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2020), May 2020, Orlando, United States
PDSEC 2020-21st IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing
PDSEC 2020-21st IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing, May 2020, News Orleans, United States. pp.1-10
[Research Report] RR-9327, Inria. 2020
PDSEC 2020-21st IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing, May 2020, News Orleans, United States
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=dedup_wf_001::76e96f82c8df7b7dbc895c3b4cd996f8
https://hal.inria.fr/hal-02513433
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje