Approximately uniform online checkpointing with bounded memory

Ahlroth, Lauri, Pottonen, Olli and Schumacher, André (2013). Approximately uniform online checkpointing with bounded memory. In: 17th International Conference on Computing and Combinatorics (COCOON 2011), Dallas, TX, United States, (234-246). 14-16 August 2011. doi:10.1007/s00453-013-9772-5

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Ahlroth, Lauri
Pottonen, Olli
Schumacher, André
Title of paper Approximately uniform online checkpointing with bounded memory
Conference name 17th International Conference on Computing and Combinatorics (COCOON 2011)
Conference location Dallas, TX, United States
Conference dates 14-16 August 2011
Journal name Algorithmica   Check publisher's open access policy
Place of Publication New York, NY, United States
Publisher Springer
Publication Year 2013
Sub-type Fully published paper
DOI 10.1007/s00453-013-9772-5
Open Access Status Not Open Access
ISSN 0178-4617
1432-0541
Volume 67
Issue 2
Start page 234
End page 246
Total pages 13
Language eng
Abstract/Summary 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 for several different measures.
Keyword Checkpointing
Online algorithm
Uniform spacing
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Conference Paper
Collection: School of Mathematics and Physics
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 2 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Sat, 28 Jun 2014, 04:43:20 EST by System User on behalf of Mathematics