Tight Bounds on Online Checkpointing Algorithms

DOI10.4230/LIPIcs.ICALP.2018.13zbMath1484.68336arXiv1704.02659OpenAlexW2887663212MaRDI QIDQ5002679

Adi Shamir, Itai Dinur, Eyal Ronen, Achiya Bar-On, Rani Hod, Nathan Keller, Orr Dunkelman

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1704.02659

zbMATH Keywords

checkpointdiscrepancyuniform distributiononline algorithmcheckpointing algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Guessing fractions of online sequences

Uses Software

• CVXOPT
• GLPK

Cites Work

• Approximately uniform online checkpointing with bounded memory
• On-line algorithms for locating checkpoints
• On the Optimum Checkpoint Selection Problem
• Online Checkpointing with Improved Worst-Case Guarantees
• On the Optimum Checkpoint Interval
• Rollback and Recovery Strategies for Computer Programs

This page was built for publication: Tight Bounds on Online Checkpointing Algorithms