Online Checkpointing with Improved Worst-Case Guarantees

DOI10.1287/ijoc.2014.0639zbMath1346.68261arXiv1302.4216OpenAlexW2114595263MaRDI QIDQ3458748

Adrian Neumann, Karl Bringmann, Jakub Sliačan, Benjamin Doerr

Publication date: 21 December 2015

Published in: INFORMS Journal on Computing, Automata, Languages, and Programming (Search for Journal in Brave)

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

zbMATH Keywords

empirical evaluationbounded memorybreakpoints

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (2)

Guessing fractions of online sequences ⋮ Tight Bounds on Online Checkpointing Algorithms

Uses Software

• Amazon EC2

Cites Work

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

This page was built for publication: Online Checkpointing with Improved Worst-Case Guarantees