Skip to main content
SpringerLink
Log in

Approximately Uniform Online Checkpointing

  • Conference paper
Computing and Combinatorics (COCOON 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6842))

Included in the following conference series:

  • 813 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asano, T.: Online uniformity of integer points on a line. Information Processing Letters 109(1), 57–60 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 1–16. ACM, New York (2002)

    Google Scholar 

  3. Bern, M., Greene, D.H., Raghunathan, A., Sudan, M.: On-line algorithms for locating checkpoints. Algorithmica 11, 33–52 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)

    Book  MATH  Google Scholar 

  5. van der Corput, J.G.: Verteilungsfunktionen. Proc. Nederl. Akad. Wetensch. 38, 813–821 (1935)

    MATH  Google Scholar 

  6. Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Dover Publications, Inc., New York (2006)

    MATH  Google Scholar 

  7. Muthukrishnan, S.: Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science 1(2), 117–236 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Nicola, V., van Spanje, J.: Comparative analysis of different models of checkpointing and recovery. IEEE Transactions on Software Engineering 16, 807–821 (1990)

    Article  Google Scholar 

  9. Niederreiter, H.: Random number generation and quasi-Monte Carlo methods. Society for Industrial and Applied Mathematics, Philadelphia (1992)

    Book  MATH  Google Scholar 

  10. Stumm, P., Walther, A.: Multistage approaches for optimal offline checkpointing. SIAM J. Sci. Comput. 31(3), 1946–1967 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Stumm, P., Walther, A.: New algorithms for optimal online checkpointing. SIAM Journal on Scientific Computing 32, 836–854 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Teramoto, S., Asano, T., Doerr, B., Katoh, N.: Inserting points uniformly at every instance. IEICE - Trans. Inf. Syst. E89-D, 2348–2356 (2006)

    Article  Google Scholar 

  13. Ziv, A., Bruck, J.: An on-line algorithm for checkpoint placement. IEEE Transactions on Computers 46, 976–985 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, Aalto University, Finland

    Lauri Ahlroth, Olli Pottonen & André Schumacher

  2. Helsinki Institute for Information Technology, P.O. Box 15400, FI-00076, Aalto, Finland

    Lauri Ahlroth, Olli Pottonen & André Schumacher

Authors
  1. Lauri Ahlroth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olli Pottonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. André Schumacher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas-Pan American, 78539, Edinburg, TX, USA

    Bin Fu

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahlroth, L., Pottonen, O., Schumacher, A. (2011). Approximately Uniform Online Checkpointing. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22685-4_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22684-7

  • Online ISBN: 978-3-642-22685-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation