Approximately uniform online checkpointing with bounded memory
From MaRDI portal
Publication:378218
DOI10.1007/s00453-013-9772-5zbMath1285.68219MaRDI 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
Related Items
Tight Bounds on Online Checkpointing Algorithms, Online Checkpointing with Improved Worst-Case Guarantees
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item