Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems

Bernd Bieker; Erik Maehle

doi:10.1007/978-1-4615-4549-1_16

Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems

Bernd Bieker, Erik Maehle

Institute of Computer Engineering

Netlife Internet Consulting und Software GmbH

Abstract

Within this paper a simulation study of coordinated checkpointing protocols for parallel systems using message passing is presented. The aim is to provide an estimation of the overhead that is produced by checkpointing. Furthermore, a comparison of different protocols and their execution on different parallel computing systems is considered. To enable this analysis a simple application model is derived which is used as a representative of a class of number-crunching programs. By means of simulations general statements on the runtime overhead generated by coordinated checkpointing protocols can be given.

Original language	English
Title of host publication	Dependable Network Computing
Editors	Dimiter R. Avresky
Number of pages	20
Volume	538
Place of Publication	Boston, MA
Publisher	Springer US
Publication date	2000
Pages	359-378
ISBN (Print)	978-1-4613-7053-6
ISBN (Electronic)	978-1-4615-4549-1
DOIs	https://doi.org/10.1007/978-1-4615-4549-1_16
Publication status	Published - 2000

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-1-4615-4549-1_16

Cite this

@inbook{b6d9409352874988bce1f4fd08da34d4,

title = "Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems",

abstract = "Within this paper a simulation study of coordinated checkpointing protocols for parallel systems using message passing is presented. The aim is to provide an estimation of the overhead that is produced by checkpointing. Furthermore, a comparison of different protocols and their execution on different parallel computing systems is considered. To enable this analysis a simple application model is derived which is used as a representative of a class of number-crunching programs. By means of simulations general statements on the runtime overhead generated by coordinated checkpointing protocols can be given.",

author = "Bernd Bieker and Erik Maehle",

year = "2000",

doi = "10.1007/978-1-4615-4549-1_16",

language = "English",

isbn = "978-1-4613-7053-6",

volume = "538",

series = "The Springer International Series in Engineering and Computer Science ",

publisher = "Springer US",

pages = "359--378",

editor = "Avresky, {Dimiter R.}",

booktitle = "Dependable Network Computing",

}

Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems. / Bieker, Bernd; Maehle, Erik.
Dependable Network Computing. ed. / Dimiter R. Avresky. Vol. 538 Boston, MA: Springer US, 2000. p. 359-378 (The Springer International Series in Engineering and Computer Science ; Vol. 538).

Research output: Chapters in Books/Reports/Conference Proceedings › Chapter › peer-review

TY - CHAP

T1 - Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems

AU - Bieker, Bernd

AU - Maehle, Erik

PY - 2000

Y1 - 2000

N2 - Within this paper a simulation study of coordinated checkpointing protocols for parallel systems using message passing is presented. The aim is to provide an estimation of the overhead that is produced by checkpointing. Furthermore, a comparison of different protocols and their execution on different parallel computing systems is considered. To enable this analysis a simple application model is derived which is used as a representative of a class of number-crunching programs. By means of simulations general statements on the runtime overhead generated by coordinated checkpointing protocols can be given.

AB - Within this paper a simulation study of coordinated checkpointing protocols for parallel systems using message passing is presented. The aim is to provide an estimation of the overhead that is produced by checkpointing. Furthermore, a comparison of different protocols and their execution on different parallel computing systems is considered. To enable this analysis a simple application model is derived which is used as a representative of a class of number-crunching programs. By means of simulations general statements on the runtime overhead generated by coordinated checkpointing protocols can be given.

UR - https://www.researchgate.net/publication/302273592_Overhead_of_Coordinated_Checkpointing_Protocols_for_Message_Passing_Parallel_Systems

U2 - 10.1007/978-1-4615-4549-1_16

DO - 10.1007/978-1-4615-4549-1_16

M3 - Chapter

SN - 978-1-4613-7053-6

VL - 538

T3 - The Springer International Series in Engineering and Computer Science

SP - 359

EP - 378

BT - Dependable Network Computing

A2 - Avresky, Dimiter R.

PB - Springer US

CY - Boston, MA

ER -

Overhead of Coordinated Checkpointing Protocols for Message Passing Parallel Systems

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this