Approximately uniform online checkpointing

Authors:
Lauri Ahlroth;Olli Pottonen;André Schumacher
Affiliations:
Aalto University, Department of Information and Computer Science and Helsinki Institute for Information Technology, Aalto, Finland;Aalto University, Department of Information and Computer Science and Helsinki Institute for Information Technology, Aalto, Finland;Aalto University, Department of Information and Computer Science and Helsinki Institute for Information Technology, Aalto, Finland
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 10
Cited 0

Comparative Analysis of Different Models of Checkpointing and Recovery

IEEE Transactions on Software Engineering
Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
An On-Line Algorithm for Checkpoint Placement

IEEE Transactions on Computers
The discrepancy method: randomness and complexity

The discrepancy method: randomness and complexity
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
Inserting Points Uniformly at Every Instance

IEICE - Transactions on Information and Systems
Online uniformity of integer points on a line

Information Processing Letters
MultiStage Approaches for Optimal Offline Checkpointing

SIAM Journal on Scientific Computing
New Algorithms for Optimal Online Checkpointing

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many complex computational processes one may want to store a sample of the process' history for later use by placing checkpoints. In this paper we consider the problem of maintaining, in an online fashion, a collection of k checkpoints as an approximately uniformly spaced sample in the history of a continuous-time process. We present deterministic algorithms tailored for small values of k and a general one for arbitrary k. The algorithms are proven to be close to optimum.