Pith. sign in

REVIEW 1 cited by

JASS: A Flexible Checkpointing System for NVM-based Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.11511 v1 pith:MHYCFS23 submitted 2023-01-27 cs.AR

classification cs.AR
keywords systemworkrecoverysystemscheckpointingdesigninstantminimize
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

NVM-based systems are naturally fit candidates for incorporating periodic checkpointing (or snapshotting). This increases the reliability of the system, makes it more immune to power failures, and reduces wasted work in especially an HPC setup. The traditional line of thinking is to design a system that is conceptually similar to transactional memory, where we log updates all the time, and minimize the wasted work or alternatively the MTTR (mean time to recovery). Such ``instant recovery'' systems allow the system to recover from a point that is quite close to the point of failure. The penalty that we pay is the prohibitive number of additional writes to the NVM. We propose a paradigmatically different approach in this paper, where we argue that in most practical settings such as regular HPC workloads or neural network training, there is no need for such instant recovery. This means that we can afford to lose some work, take periodic software-initiated checkpoints and still meet the goals of the application. The key benefit of our scheme is that we reduce write amplification substantially; this extends the life of NVMs by roughly the same factor. We go a step further and design an adaptive system that can minimize the WA given a target checkpoint latency, and show that our control algorithm almost always performs near-optimally. Our scheme reduces the WA by 2.3-96\% as compared to the nearest competing work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. KoopAGRU: A Koopman-based Anomaly Detection in Time-Series using Gated Recurrent Units

    cs.LG 2025-01 conditional novelty 5.0 of 10

    KoopAGRU, a GRU-based Koopman model with FFT time-variant/invariant decomposition, reports an average F1 of 90.88% on five anomaly detection benchmarks, exceeding cited baselines.

Pith tools