Approximately uniform online checkpointing with bounded memory

DOI10.1007/S00453-013-9772-5zbMath1285.68219OpenAlexW2081834735MaRDI QIDQ378218

Olli Pottonen, Lauri Ahlroth, André Schumacher

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9772-5

zbMATH Keywords

checkpointingonline algorithmuniform spacing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online Checkpointing with Improved Worst-Case Guarantees ⋮ Tight Bounds on Online Checkpointing Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online uniformity of integer points on a line
• On-line algorithms for locating checkpoints
• Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules
• New Algorithms for Optimal Online Checkpointing
• Data Streams: Algorithms and Applications
• MultiStage Approaches for Optimal Offline Checkpointing
• Numerical Solution of a Flow-Control Problem: Vorticity Reduction by Dynamic Boundary Action

This page was built for publication: Approximately uniform online checkpointing with bounded memory