Checkpointing scheme: Difference between revisions

Content deleted Content added

Revision as of 21:03, 12 July 2010 edit Rich Farmbrough (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, File movers, IP block exemptions, Pending changes reviewers, Rollbackers, Template editors 1,734,015 edits m →References: Date maintenance tags and general fixes: build 424: using AWB ← Previous edit		Latest revision as of 20:16, 6 January 2022 edit undo Crteianlian (talk \| contribs) 39 edits No edit summary
(5 intermediate revisions by 4 users not shown)
Line 1: {{Use American English\|date = March 2019}} '''Checkpointing schemes''' are scientific computing algorithms used in solving time dependent [[adjoint equation]], as well as reverse mode [[automatic differentiation]].▼ {{Short description\|Type of algorithm}} {{Use mdy dates\|date = March 2019}} ▲'''Checkpointing schemes''' are scientific computing algorithms used in solving time dependent [[adjoint equation]]s, as well as reverse mode [[automatic differentiation]].<ref>D. K. Pradhan and N. H. Vaidya, "Roll-forward checkpointing scheme: a novel fault-tolerant architecture," in IEEE Transactions on Computers, vol. 43, no. 10, pp. 1163-1174, Oct. 1994, doi: 10.1109/12.324542.</ref> ==References==▼ ▲==References== {{Reflist}} ==Bibliography== * {{Cite book \| last = Griewank