default search action
Julien Herrmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Daiane I. Dolci
, James R. Maddison
checkpoint_schedules: schedules for incremental checkpointing of adjoint simulations. J. Open Source Softw. 9(96): 6148 (2024) - [j11]Olivier Beaumont
Optimal Re-Materialization Strategies for Heterogeneous Chains: How to Train Deep Neural Networks with Limited Memory. ACM Trans. Math. Softw. 50(2): 10:1-10:38 (2024) - 2023
- [j10]Emmanuel Agullo
Task-based Parallel Programming for Scalable Matrix Product Algorithms. ACM Trans. Math. Softw. 49(2): 15:1-15:23 (2023) - 2020
- [j9]Julien Herrmann, Guillaume Pallez:
H-Revolve: A Framework for Adjoint Computation on Synchronous Hierarchical Platforms. ACM Trans. Math. Softw. 46(2): 12:1-12:25 (2020)
2010 – 2019
- 2019
- [j8]Julien Herrmann, M. Yusuf Özkaya, Bora Uçar
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. SIAM J. Sci. Comput. 41(4): A2117-A2145 (2019) - [c9]M. Yusuf Özkaya, Anne Benoit
A Scalable Clustering-Based Task Scheduler for Homogeneous Processors Using DAG Partitioning. IPDPS 2019: 155-165 - [i2]Olivier Beaumont, Lionel Eyraud-Dubois, Julien Herrmann, Alexis Joly, Alena Shilova:
Optimal checkpointing for heterogeneous chains: how to train deep neural networks with limited memory. CoRR abs/1911.13214 (2019) - 2018
- [j7]Henri Casanova, Julien Herrmann
Computing the expected makespan of task graphs in the presence of silent errors. Parallel Comput. 75: 41-60 (2018) - 2017
- [j6]Guillaume Aupy, Julien Herrmann:
Periodicity in optimal hierarchical checkpointing schemes for adjoint computations. Optim. Methods Softw. 32(3): 594-624 (2017) - [c8]Julien Herrmann, Jonathan Kho, Bora Uçar
Acyclic Partitioning of Large Directed Acyclic Graphs. CCGrid 2017: 371-380 - 2016
- [j5]Julien Herrmann
Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results. Parallel Comput. 52: 22-41 (2016) - [j4]Guillaume Aupy, Julien Herrmann, Paul D. Hovland
Optimal Multistage Algorithm for Adjoint Computation. SIAM J. Sci. Comput. 38(3) (2016) - [c7]Julien Herrmann, Zachary L. Witter, Nakul Patel, Jonathan Kho, Daniel A. Janies, Ümit V. Çatalyürek:
Visual analytics on the spread of pathogens. BCB 2016: 519-520 - [c6]Henri Casanova, Julien Herrmann, Yves Robert:
Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors. ICPP Workshops 2016: 141-150 - 2015
- [b1]Julien Herrmann:
Memory-aware Algorithms and Scheduling Techniques for Matrix Computattions. (Algorithmes orientés mémoire et techniques d'ordonnancement pour le calcul matriciel). École normale supérieure de Lyon, France, 2015 - [j3]Julien Herrmann, Loris Marchal
Memory-aware tree traversals with pre-assigned tasks. J. Parallel Distributed Comput. 75: 53-66 (2015) - [j2]Mathieu Faverge, Julien Herrmann
Mixing LU and QR factorization algorithms to design high-performance dense linear algebra solvers. J. Parallel Distributed Comput. 85: 32-46 (2015) - [c5]Emmanuel Agullo, Olivier Beaumont
Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms. IPDPS Workshops 2015: 34-45 - 2014
- [c4]Julien Herrmann, Loris Marchal
Memory-Aware List Scheduling for Hybrid Platforms. IPDPS Workshops 2014: 689-698 - [c3]Mathieu Faverge, Julien Herrmann, Julien Langou, Bradley R. Lowery, Yves Robert
Designing LU-QR Hybrid Solvers for Performance and Stability. IPDPS 2014: 1029-1038 - [c2]Thomas Hérault
Determining the Optimal Redistribution for a Given Data Partition. ISPDC 2014: 95-102 - [i1]Mathieu Faverge, Julien Herrmann, Julien Langou, Bradley R. Lowery, Yves Robert, Jack J. Dongarra:
Designing LU-QR hybrid solvers for performance and stability. CoRR abs/1401.5522 (2014) - 2013
- [j1]Marc Baboulin, Jack J. Dongarra, Julien Herrmann, Stanimire Tomov
Accelerating Linear System Solutions Using Randomization Techniques. ACM Trans. Math. Softw. 39(2): 8:1-8:13 (2013) - [c1]Julien Herrmann, Loris Marchal
Model and Complexity Results for Tree Traversals on Hybrid Platforms. Euro-Par 2013: 647-658
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-10-04 20:04 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: