Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
From MaRDI portal
(Redirected from Publication:5268940)
Recommendations
- Optimal multistage algorithm for adjoint computation
- New algorithms for optimal online checkpointing
- Checkpointing schemes for adjoint codes: Application to the meteorological model Meso-NH
- H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
- Multistage approaches for optimal offline checkpointing
Cites work
- A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes system
- Algorithm 799: revolve
- Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
- Multistage approaches for optimal offline checkpointing
- New algorithms for optimal online checkpointing
Cited in
(6)- H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
- New algorithms for optimal online checkpointing
- Structure exploiting adjoints for finite element discretizations
- Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
- Optimal multistage algorithm for adjoint computation
- On nonlinear transitions, minimal seeds and exact solutions for the geodynamo
This page was built for publication: Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268940)