default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentin Le Fèvre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Valentin Le Fèvre
, Marc Casas:
Efficient Execution of SpGEMM on Long Vector Architectures. HPDC 2023: 101-113- [i3]Valentin Le Fèvre, Marc Casas:
Optimization of SpGEMM with Risc-V vector instructions. CoRR abs/2303.02471 (2023) - 2022
- [j8]George Bosilca, Aurélien Bouteiller, Thomas Hérault, Valentin Le Fèvre, Yves Robert, Jack J. Dongarra:
Comparing Distributed Termination Detection Algorithms for Modern HPC Platforms. Int. J. Netw. Comput. 12(1): 26-46 (2022) - [j7]Anne Benoit, Valentin Le Fèvre, Lucas Perotin, Padma Raghavan, Yves Robert, Hongyang Sun:
Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors. IEEE Trans. Computers 71(7): 1696-1710 (2022) - [c13]Valentin Le Fèvre, Tetsuzo Usui, Marc Casas:
A Selective Nesting Approach for the Sparse Multi-threaded Cholesky Factorization. ESPM2@SC 2022: 1-9 - [i2]Valentin Le Fèvre, Tetsuzo Usui, Marc Casas:
Optimization of the Sparse Multi-Threaded Cholesky Factorization for A64FX. CoRR abs/2202.09288 (2022) - 2021
- [j6]Anne Benoit, Valentin Le Fèvre, Padma Raghavan, Yves Robert, Hongyang Sun:
Resilient Scheduling Heuristics for Rigid Parallel Jobs. Int. J. Netw. Comput. 11(1): 2-26 (2021) - [c12]George Bosilca, Aurélien Bouteiller, Thomas Hérault, Valentin Le Fèvre, Yves Robert, Jack J. Dongarra:
Revisiting Credit Distribution Algorithms for Distributed Termination Detection. IPDPS Workshops 2021: 611-620 - 2020
- [b1]Valentin Le Fèvre:
Resilient scheduling algorithms for large-scale platforms. (Algorithmes d'ordonnancement tolérants aux fautes pour les plates-formes à large échelle). University of Lyon, France, 2020 - [c11]Anne Benoit, Valentin Le Fèvre, Lucas Perotin, Padma Raghavan, Yves Robert, Hongyang Sun:
Resilient Scheduling of Moldable Jobs on Failure-Prone Platforms. CLUSTER 2020: 81-91 - [c10]Valentin Le Fèvre, Thomas Hérault, Julien Langou, Yves Robert:
A Comparison of Several Fault-Tolerance Methods for the Detection and Correction of Floating-Point Errors in Matrix-Matrix Multiplication. Euro-Par Workshops 2020: 303-315 - [c9]Anne Benoit, Valentin Le Fèvre, Padma Raghavan, Yves Robert, Hongyang Sun:
Design and Comparison of Resilient Scheduling Heuristics for Parallel Jobs. IPDPS Workshops 2020: 567-576
2010 – 2019
- 2019
- [j5]Li Han, Valentin Le Fèvre, Louis-Claude Canon, Yves Robert, Frédéric Vivien:
A generic approach to scheduling and checkpointing workflows. Int. J. High Perform. Comput. Appl. 33(6) (2019) - [j4]Anne Benoit, Aurélien Cavelan, Florina M. Ciorba, Valentin Le Fèvre, Yves Robert:
Combining Checkpointing and Replication for Reliable Execution of Linear Workflows with Fail-Stop and Silent Errors. Int. J. Netw. Comput. 9(1): 2-27 (2019) - [j3]Valentin Le Fèvre, Thomas Hérault, Yves Robert, Aurélien Bouteiller, Atsushi Hori, George Bosilca, Jack J. Dongarra:
Comparing the performance of rigid, moldable and grid-shaped applications on failure-prone HPC platforms. Parallel Comput. 85: 1-12 (2019) - [j2]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
I/O Scheduling Strategy for Periodic Applications. ACM Trans. Parallel Comput. 6(2): 7:1-7:26 (2019) - [c8]Anne Benoit, Thomas Hérault, Valentin Le Fèvre, Yves Robert:
Replication is more efficient than you think. SC 2019: 89:1-89:14 - 2018
- [c7]Valentin Le Fèvre, George Bosilca, Aurélien Bouteiller, Thomas Hérault, Atsushi Hori, Yves Robert, Jack J. Dongarra:
Do Moldable Applications Perform Better on Failure-Prone HPC Platforms? Euro-Par Workshops 2018: 787-799 - [c6]Li Han, Valentin Le Fèvre, Louis-Claude Canon, Yves Robert, Frédéric Vivien:
A Generic Approach to Scheduling and Checkpointing Workflows. ICPP 2018: 28:1-28:10 - [c5]Anne Benoit, Aurélien Cavelan, Florina M. Ciorba, Valentin Le Fèvre, Yves Robert:
Combining Checkpointing and Replication for Reliable Execution of Linear Workflows. IPDPS Workshops 2018: 793-802 - [c4]Valentin Le Fèvre, Leonardo Bautista-Gomez, Osman S. Unsal, Marc Casas:
Approximating a Multi-Grid Solver. PMBS@SC 2018: 97-107 - 2017
- [j1]Anne Benoit, Aurélien Cavelan, Valentin Le Fèvre, Yves Robert, Hongyang Sun:
Towards Optimal Multi-Level Checkpointing. IEEE Trans. Computers 66(7): 1212-1226 (2017) - [c3]Anne Benoit, Aurélien Cavelan, Valentin Le Fèvre, Yves Robert:
Optimal Checkpointing Period with Replicated Execution on Heterogeneous Platforms. FTXS@HPDC 2017: 9-16 - [c2]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
Periodic I/O Scheduling for Super-Computers. PMBS@SC 2017: 44-66 - [i1]Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
Periodic I/O scheduling for super-computers. CoRR abs/1702.06900 (2017) - 2016
- [c1]Anne Benoit, Aurélien Cavelan, Valentin Le Fèvre, Yves Robert, Hongyang Sun:
A Different Re-execution Speed Can Help. ICPP Workshops 2016: 250-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
