Skip to main content
SpringerLink
Log in

A Framework for Automatic Identification of the Best Checkpoint and Recovery Protocol

  • Conference paper
Distributed Computing - IWDC 2004 (IWDC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3326))

Included in the following conference series:

  • 525 Accesses

Abstract

Fault tolerance is important for a distributed system to increase its reliability and throughput. Checkpoint and recovery protocols have been proposed as fault tolerance for non-critical applications. The performance of checkpoint and recovery protocols plays an important role in the overall performance of a distributed system. The performance of these protocols depends on system characteristics as well as an application characteristics. In this paper, we propose a novel technique to automatically identify the checkpoint and recovery protocol which is likely to perform the best for a given system and an application the system is currently running. We present experimental results to show that the scheme can efficiently determine a suitable checkpoint and recovery protocol for many applications.

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. Elnozahy, E.N., Alvisi, L., Wang, Y.M., Johnson, D.B.: A survey of rollback-recovery protocols in message-passing systems 34(3), 375–408 (September 2002)

    Google Scholar 

  2. Fortin, S.: The graph isomorphism problem. Technical Report 96-20, University of Alberta, CS dept. (July 1996)

    Google Scholar 

  3. Golub, G.H., Van Loan, C.F.: Matrix Computations, 2nd edn. The John Hopkins University Press (1989)

    Google Scholar 

  4. Hageman, L., Young, D.: Applied Iterative Methods. Academic Press, New York (1981)

    MATH  Google Scholar 

  5. Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)

    MATH  Google Scholar 

  6. Paul, H.S., Gupta, A., Badrinath, R.: Performance comparison of checkpoint and recovery protocols. Journal of Concurrency and Computation: Practice and Experience 15(15), 1363–1386 (2003)

    Article  Google Scholar 

  7. Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM 23(3), 31–42 (1976)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, 721302, India

    Himadri S. Paul & Arobinda Gupta

  2. Department of Computer Science, University of Illinois at Urbana-Champaign, Illinois, USA

    Amit Sharma

Authors
  1. Himadri S. Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arobinda Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amit Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Informatics, Arizona State University, 85287, Tempe, AZ,  

    Arunabha Sen

  2. Indian Statistical Institute, Kolkata,  

    Nabanita Das

  3. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, 76019, Arlington, TX, USA

    Sajal K. Das

  4. ACM Unit, Indian Statistical Institute, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paul, H.S., Gupta, A., Sharma, A. (2004). A Framework for Automatic Identification of the Best Checkpoint and Recovery Protocol. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30536-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24076-1

  • Online ISBN: 978-3-540-30536-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation