A quasi-synchronous checkpointing algorithm that prevents contention for stable storage

D. Manivannan; Q. Jiang; Jianchang Yang; M. Singhal

doi:10.1016/j.ins.2008.04.001

A quasi-synchronous checkpointing algorithm that prevents contention for stable storage

D. Manivannan
, Q. Jiang
, Jianchang Yang
, M. Singhal

Producción científica: Article › revisión exhaustiva

8 Citas (Scopus)

Resumen

Checkpointing and rollback recovery are established techniques for handling failures in distributed systems. Under synchronous checkpointing, each process involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance as processes may have to wait for long time for the checkpointing operation to complete. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead.

Idioma original	English
Páginas (desde-hasta)	3110-3117
Número de páginas	8
Publicación	Information Sciences
Volumen	178
N.º	15
DOI	https://doi.org/10.1016/j.ins.2008.04.001
Estado	Published - ago 1 2008

Nota bibliográfica

Funding Information:
The authors thank the editors and reviewers for their valuable and constructive comments which helped greatly in improving the content and presentation of the paper. This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791 and the US Department of Treasury Award #T0505060. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or the Department of Treasury.

Financiación

The authors thank the editors and reviewers for their valuable and constructive comments which helped greatly in improving the content and presentation of the paper. This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791 and the US Department of Treasury Award #T0505060. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or the Department of Treasury.

Financiadores	Número del financiador
National Science Foundation (NSF)	IIS-0414791, 0505060

ASJC Scopus subject areas

Theoretical Computer Science
Software
Control and Systems Engineering
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Acceder al documento

10.1016/j.ins.2008.04.001

Otros archivos y enlaces

Citar esto

@article{f089fd84576e4242b9164e73d6717fda,

title = "A quasi-synchronous checkpointing algorithm that prevents contention for stable storage",

abstract = "Checkpointing and rollback recovery are established techniques for handling failures in distributed systems. Under synchronous checkpointing, each process involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance as processes may have to wait for long time for the checkpointing operation to complete. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead.",

keywords = "Checkpoint staggering, Communication-induced checkpointing, Distributed checkpointing, Failure-recovery, Fault-tolerance, Rollback recovery, Staggered checkpointing, Uncoordinated",

author = "D. Manivannan and Q. Jiang and Jianchang Yang and M. Singhal",

note = "Funding Information: The authors thank the editors and reviewers for their valuable and constructive comments which helped greatly in improving the content and presentation of the paper. This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791 and the US Department of Treasury Award \#T0505060. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or the Department of Treasury.",

year = "2008",

month = aug,

day = "1",

doi = "10.1016/j.ins.2008.04.001",

language = "English",

volume = "178",

pages = "3110--3117",

number = "15",

}

TY - JOUR

T1 - A quasi-synchronous checkpointing algorithm that prevents contention for stable storage

AU - Manivannan, D.

AU - Jiang, Q.

AU - Yang, Jianchang

AU - Singhal, M.

N1 - Funding Information: The authors thank the editors and reviewers for their valuable and constructive comments which helped greatly in improving the content and presentation of the paper. This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791 and the US Department of Treasury Award #T0505060. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or the Department of Treasury.

PY - 2008/8/1

Y1 - 2008/8/1

N2 - Checkpointing and rollback recovery are established techniques for handling failures in distributed systems. Under synchronous checkpointing, each process involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance as processes may have to wait for long time for the checkpointing operation to complete. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead.

AB - Checkpointing and rollback recovery are established techniques for handling failures in distributed systems. Under synchronous checkpointing, each process involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance as processes may have to wait for long time for the checkpointing operation to complete. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead.

KW - Checkpoint staggering

KW - Communication-induced checkpointing

KW - Distributed checkpointing

KW - Failure-recovery

KW - Fault-tolerance

KW - Rollback recovery

KW - Staggered checkpointing

KW - Uncoordinated

UR - https://www.scopus.com/pages/publications/44949200997

UR - https://www.scopus.com/pages/publications/44949200997#tab=citedBy

U2 - 10.1016/j.ins.2008.04.001

DO - 10.1016/j.ins.2008.04.001

M3 - Article

AN - SCOPUS:44949200997

SN - 0020-0255

VL - 178

SP - 3110

EP - 3117

JO - Information Sciences

JF - Information Sciences

IS - 15

ER -

A quasi-synchronous checkpointing algorithm that prevents contention for stable storage

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto