From 5bc8feb69be93133fb0288a754919f4a330f477e Mon Sep 17 00:00:00 2001 From: Iglesia Dolci Date: Tue, 23 Jan 2024 14:01:37 +0000 Subject: [PATCH] Add RAM meaning. --- docs/paper/paper.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/docs/paper/paper.md b/docs/paper/paper.md index 8110004..bad8dfc 100644 --- a/docs/paper/paper.md +++ b/docs/paper/paper.md @@ -69,8 +69,7 @@ forward steps are run more than once. Griewank and Walther (2000) proposed a checkpointing algorithm which is optimal under certain assumptions, including that the number of steps is known in advance, and that all the storage has equal access cost [@griewank2000algorithm]. Subsequent authors have produced checkpointing algorithms that relax these requirements in various ways, such as by accounting for -different types of storage (e.g. RAM and disk) or by not requiring the number of steps to be -known in advance, for example [@stumm2009multistage; @aupy2016optimal; @schanen2016; @aupy2017periodicity; @herrmann2020; @maddison2023; @Zhang_2023]. +different types of storage (e.g. RAM (Random-Access Memory) and disk) or by not requiring the number of steps to be known in advance, for example [@stumm2009multistage; @aupy2016optimal; @schanen2016; @aupy2017periodicity; @herrmann2020; @maddison2023; @Zhang_2023]. # Statement of need