Skip to content

Commit

Permalink
Merge pull request #5163 from openjournals/joss.06148
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored Mar 22, 2024
2 parents ea3dc11 + 0b5b1f3 commit 1816e5f
Show file tree
Hide file tree
Showing 3 changed files with 909 additions and 0 deletions.
351 changes: 351 additions & 0 deletions joss.06148/10.21105.joss.06148.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,351 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
xmlns:rel="http://www.crossref.org/relations.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
version="5.3.1"
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
<head>
<doi_batch_id>20240322T135459-d7343ee749f9c6ebe57a9395e0995c05dcf129ef</doi_batch_id>
<timestamp>20240322135459</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>03</month>
<year>2024</year>
</publication_date>
<journal_volume>
<volume>9</volume>
</journal_volume>
<issue>95</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>checkpoint_schedules: schedules for incremental
checkpointing of adjoint simulations</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Daiane I.</given_name>
<surname>Dolci</surname>
<ORCID>https://orcid.org/0000-0002-1435-9538</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>James R.</given_name>
<surname>Maddison</surname>
<ORCID>https://orcid.org/0000-0001-5742-4363</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>David A.</given_name>
<surname>Ham</surname>
<ORCID>https://orcid.org/0000-0001-9545-9110</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Guillaume</given_name>
<surname>Pallez</surname>
<ORCID>https://orcid.org/0000-0001-8862-3277</ORCID>
</person_name>
<person_name sequence="additional"
contributor_role="author">
<given_name>Julien</given_name>
<surname>Herrmann</surname>
<ORCID>https://orcid.org/0000-0003-4935-2368</ORCID>
</person_name>
</contributors>
<publication_date>
<month>03</month>
<day>22</day>
<year>2024</year>
</publication_date>
<pages>
<first_page>6148</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06148</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.5281/zenodo.10817312</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6148</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06148</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06148</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06148.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="aupy2016optimal">
<article_title>Optimal multistage algorithm for adjoint
computation</article_title>
<author>Aupy</author>
<journal_title>SIAM Journal on Scientific
Computing</journal_title>
<issue>3</issue>
<volume>38</volume>
<doi>10.1145/347837.347846</doi>
<cYear>2016</cYear>
<unstructured_citation>Aupy, G., Herrmann, J., Hovland, P.,
&amp; Robert, Y. (2016). Optimal multistage algorithm for adjoint
computation. SIAM Journal on Scientific Computing, 38(3), C232–C255.
https://doi.org/10.1145/347837.347846</unstructured_citation>
</citation>
<citation key="Plessix2006">
<article_title>A review of the adjoint-state method for
computing the gradient of a functional with geophysical
applications</article_title>
<author>Plessix</author>
<journal_title>Geophys. J. Int</journal_title>
<volume>167</volume>
<doi>10.1111/j.1365-246X.2006.02978.x</doi>
<cYear>2006</cYear>
<unstructured_citation>Plessix, R.-E. (2006). A review of
the adjoint-state method for computing the gradient of a functional with
geophysical applications. Geophys. J. Int, 167, 495–503.
https://doi.org/10.1111/j.1365-246X.2006.02978.x</unstructured_citation>
</citation>
<citation key="papadopoulos2021computing">
<article_title>Computing multiple solutions of topology
optimization problems</article_title>
<author>Papadopoulos</author>
<journal_title>SIAM Journal on Scientific
Computing</journal_title>
<issue>3</issue>
<volume>43</volume>
<doi>10.1137/20M1326209</doi>
<cYear>2021</cYear>
<unstructured_citation>Papadopoulos, I. P., Farrell, P. E.,
&amp; Surowiec, T. M. (2021). Computing multiple solutions of topology
optimization problems. SIAM Journal on Scientific Computing, 43(3),
A1555–A1582. https://doi.org/10.1137/20M1326209</unstructured_citation>
</citation>
<citation key="Jansen2011">
<article_title>Adjoint-based optimization of multi-phase
flow through porous media – a review</article_title>
<author>Jansen</author>
<journal_title>Computers &amp; Fluids</journal_title>
<issue>1</issue>
<volume>46</volume>
<doi>10.1016/j.compfluid.2010.09.039</doi>
<issn>0045-7930</issn>
<cYear>2011</cYear>
<unstructured_citation>Jansen, J. D. (2011). Adjoint-based
optimization of multi-phase flow through porous media – a review.
Computers &amp; Fluids, 46(1), 40–51.
https://doi.org/10.1016/j.compfluid.2010.09.039</unstructured_citation>
</citation>
<citation key="griewank2000algorithm">
<article_title>Revolve: An implementation of checkpointing
for the reverse or adjoint mode of computational
differentiation</article_title>
<author>Griewank</author>
<journal_title>ACM Transactions on Mathematical Software
(TOMS)</journal_title>
<issue>1</issue>
<volume>26</volume>
<doi>10.1145/347837.347846</doi>
<cYear>2000</cYear>
<unstructured_citation>Griewank, A., &amp; Walther, A.
(2000). Revolve: An implementation of checkpointing for the reverse or
adjoint mode of computational differentiation. ACM Transactions on
Mathematical Software (TOMS), 26(1), 19–45.
https://doi.org/10.1145/347837.347846</unstructured_citation>
</citation>
<citation key="herrmann2020">
<article_title>H-revolve: A framework for adjoint
computation on synchronous hierarchical platforms</article_title>
<author>Herrmann</author>
<journal_title>ACM Transactions on Mathematical Software
(TOMS)</journal_title>
<issue>2</issue>
<volume>46</volume>
<doi>10.1145/3378672</doi>
<cYear>2020</cYear>
<unstructured_citation>Herrmann, J., &amp; Pallez, G.
(2020). H-revolve: A framework for adjoint computation on synchronous
hierarchical platforms. ACM Transactions on Mathematical Software
(TOMS), 46(2), 1–25.
https://doi.org/10.1145/3378672</unstructured_citation>
</citation>
<citation key="stumm2009multistage">
<article_title>Multistage approaches for optimal offline
checkpointing</article_title>
<author>Stumm</author>
<journal_title>SIAM Journal on Scientific
Computing</journal_title>
<issue>3</issue>
<volume>31</volume>
<doi>10.1137/080718036</doi>
<cYear>2009</cYear>
<unstructured_citation>Stumm, P., &amp; Walther, A. (2009).
Multistage approaches for optimal offline checkpointing. SIAM Journal on
Scientific Computing, 31(3), 1946–1967.
https://doi.org/10.1137/080718036</unstructured_citation>
</citation>
<citation key="maddison2023">
<article_title>On the implementation of checkpointing with
high-level algorithmic differentiation</article_title>
<author>Maddison</author>
<journal_title>arXiv preprint
arXiv:2305.09568</journal_title>
<doi>10.48550/arXiv.2305.09568</doi>
<cYear>2023</cYear>
<unstructured_citation>Maddison, J. R. (2023). On the
implementation of checkpointing with high-level algorithmic
differentiation. arXiv Preprint arXiv:2305.09568.
https://doi.org/10.48550/arXiv.2305.09568</unstructured_citation>
</citation>
<citation key="tlm2019">
<article_title>Automated calculation of higher order partial
differential equation constrained derivative information</article_title>
<author>Maddison</author>
<journal_title>SIAM Journal on Scientific
Computing</journal_title>
<issue>5</issue>
<volume>41</volume>
<doi>10.1137/18M1209465</doi>
<cYear>2019</cYear>
<unstructured_citation>Maddison, J. R., Goldberg, D. N.,
&amp; Goddard, B. D. (2019). Automated calculation of higher order
partial differential equation constrained derivative information. SIAM
Journal on Scientific Computing, 41(5), C417–C445.
https://doi.org/10.1137/18M1209465</unstructured_citation>
</citation>
<citation key="schanen2016">
<article_title>Asynchronous two-level checkpointing scheme
for large-scale adjoints in the spectral-element solver
Nek5000</article_title>
<author>Schanen</author>
<journal_title>Procedia Computer Science</journal_title>
<volume>80</volume>
<doi>10.1016/j.procs.2016.05.444</doi>
<issn>1877-0509</issn>
<cYear>2016</cYear>
<unstructured_citation>Schanen, M., Marin, O., Zhang, H.,
&amp; Anitescu, M. (2016). Asynchronous two-level checkpointing scheme
for large-scale adjoints in the spectral-element solver Nek5000.
Procedia Computer Science, 80, 1147–1158.
https://doi.org/10.1016/j.procs.2016.05.444</unstructured_citation>
</citation>
<citation key="aupy2017periodicity">
<article_title>Periodicity in optimal hierarchical
checkpointing schemes for adjoint computations</article_title>
<author>Aupy</author>
<journal_title>Optimization Methods and
Software</journal_title>
<issue>3</issue>
<volume>32</volume>
<doi>10.1080/10556788.2016.1230612</doi>
<cYear>2017</cYear>
<unstructured_citation>Aupy, G., &amp; Herrmann, J. (2017).
Periodicity in optimal hierarchical checkpointing schemes for adjoint
computations. Optimization Methods and Software, 32(3), 594–624.
https://doi.org/10.1080/10556788.2016.1230612</unstructured_citation>
</citation>
<citation key="pringle2016providing">
<article_title>Providing the ARCHER community with adjoint
modelling tools for high-performance oceanographic and cryospheric
computation</article_title>
<author>Pringle</author>
<cYear>2016</cYear>
<unstructured_citation>Pringle, G., Jones, D. C., Goswami,
S., Narayanan, S. H. K., &amp; Goldberg, D. (2016). Providing the ARCHER
community with adjoint modelling tools for high-performance
oceanographic and cryospheric computation. EPCC.
https://nora.nerc.ac.uk/id/eprint/516314/</unstructured_citation>
</citation>
<citation key="Zhang_2023">
<article_title>Optimal checkpointing for adjoint multistage
time-stepping schemes</article_title>
<author>Zhang</author>
<journal_title>Journal of Computational
Science</journal_title>
<volume>66</volume>
<doi>10.1016/j.jocs.2022.101913</doi>
<issn>1877-7503</issn>
<cYear>2023</cYear>
<unstructured_citation>Zhang, H., &amp; Constantinescu, E.
M. (2023). Optimal checkpointing for adjoint multistage time-stepping
schemes. Journal of Computational Science, 66, 101913.
https://doi.org/10.1016/j.jocs.2022.101913</unstructured_citation>
</citation>
<citation key="Mitusch2019">
<article_title>Dolfin-adjoint 2018.1: Automated adjoints for
FEniCS and Firedrake</article_title>
<author>Mitusch</author>
<journal_title>Journal of Open Source
Software</journal_title>
<issue>38</issue>
<volume>4</volume>
<doi>10.21105/joss.01292</doi>
<cYear>2019</cYear>
<unstructured_citation>Mitusch, S. K., Funke, S. W., &amp;
Dokken, J. S. (2019). Dolfin-adjoint 2018.1: Automated adjoints for
FEniCS and Firedrake. Journal of Open Source Software, 4(38), 1292.
https://doi.org/10.21105/joss.01292</unstructured_citation>
</citation>
<citation key="FiredrakeUserManual">
<volume_title>Firedrake user manual</volume_title>
<author>Ham</author>
<doi>10.25561/104839</doi>
<cYear>2023</cYear>
<unstructured_citation>Ham, D. A., Kelly, P. H. J.,
Mitchell, L., Cotter, C. J., Kirby, R. C., Sagiyama, K., Bouziani, N.,
Vorderwuelbecke, S., Gregory, T. J., Betteridge, J., Shapero, D. R.,
Nixon-Hill, R. W., Ward, C. J., Farrell, P. E., Brubeck, P. D., Marsden,
I., Gibson, T. H., Homolya, M., Sun, T., … Markall, G. R. (2023).
Firedrake user manual (First edition). Imperial College London;
University of Oxford; Baylor University; University of Washington.
https://doi.org/10.25561/104839</unstructured_citation>
</citation>
<citation key="AlnaesEtal2015">
<article_title>The FEniCS project version
1.5</article_title>
<author>Alnaes</author>
<journal_title>Archive of Numerical Software</journal_title>
<volume>3</volume>
<doi>10.11588/ans.2015.100.20553</doi>
<cYear>2015</cYear>
<unstructured_citation>Alnaes, M. S., Blechta, J., Hake, J.,
Johansson, A., Kehlet, B., Logg, A., Richardson, C., Ring, J., Rognes,
M. E., &amp; Wells, G. N. (2015). The FEniCS project version 1.5.
Archive of Numerical Software, 3.
https://doi.org/10.11588/ans.2015.100.20553</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Loading

0 comments on commit 1816e5f

Please sign in to comment.