default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Perotin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Lucas Perotin:
Scheduling algorithms to optimize the performance, energy consumption and robustness of HPC applications. (Algorithmes d'ordonnancement pour optimiser les performances, la consommation d'énergie et la robustesse des applications de calcul à haute performance (HPC)). École normale supérieure de Lyon, France, 2023
Journal Articles
- 2024
- [j6]Lucas Perotin, Sandhya Kandaswamy, Hongyang Sun
, Padma Raghavan:
Multi-resource scheduling of moldable workflows. J. Parallel Distributed Comput. 184: 104792 (2024) - [j5]Anne Benoit, Thomas Hérault, Lucas Perotin, Yves Robert, Frédéric Vivien:
Revisiting I/O bandwidth-sharing strategies for HPC applications. J. Parallel Distributed Comput. 188: 104863 (2024) - [j4]Anne Benoit, Lucas Perotin, Yves Robert, Frédéric Vivien:
Checkpointing Strategies to Tolerate Non-Memoryless Failures on HPC Platforms. ACM Trans. Parallel Comput. 11(1): 1:1-1:26 (2024) - [j3]Lucas Perotin, Hongyang Sun:
Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models. ACM Trans. Parallel Comput. 11(1): 2:1-2:31 (2024) - 2022
- [j2]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) - [j1]Anne Benoit, Lucas Perotin, Yves Robert, Hongyang Sun:
Checkpointing Workflows à la Young/Daly Is Not Good Enough. ACM Trans. Parallel Comput. 9(4): 14:1-14:25 (2022)
Conference and Workshop Papers
- 2023
- [c5]Lucas Perotin, Chaojie Zhang, Rajini Wijayawardana, Anne Benoit, Yves Robert, Andrew A. Chien:
Risk-Aware Scheduling Algorithms for Variable Capacity Resources. SC Workshops 2023: 1306-1315 - 2022
- [c4]Anne Benoit, Yishu Du, Thomas Hérault, Loris Marchal, Guillaume Pallez, Lucas Perotin, Yves Robert, Hongyang Sun, Frédéric Vivien:
Checkpointing à la Young/Daly: An Overview. IC3 2022: 701-710 - [c3]Anne Benoit, Lucas Perotin, Yves Robert, Hongyang Sun:
Online Scheduling of Moldable Task Graphs under Common Speedup Models. ICPP 2022: 51:1-51:11 - 2021
- [c2]Lucas Perotin, Hongyang Sun, Padma Raghavan:
Multi-Resource List Scheduling of Moldable Parallel Jobs under Precedence Constraints. ICPP 2021: 23:1-23:10 - 2020
- [c1]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
Informal and Other Publications
- 2023
- [i2]Lucas Perotin, Hongyang Sun:
Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models. CoRR abs/2304.14127 (2023) - 2021
- [i1]Lucas Perotin, Hongyang Sun, Padma Raghavan:
Multi-Resource List Scheduling of Moldable Parallel Jobs under Precedence Constraints. CoRR abs/2106.07059 (2021)
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-06-19 21:46 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:
