FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yi Luo Articles by D. Manivannan

Third International Conference on Systems (icons 2008)

April 13-April 18

ISBN: 978-0-7695-3105-2

	ASCII Text	x
	Yi Luo, D. Manivannan, "FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol," Systems, Second International Conference on, pp. 16-22, Third International Conference on Systems (icons 2008), 2008.

	BibTex	x
	@article{ 10.1109/ICONS.2008.14, author = {Yi Luo and D. Manivannan}, title = {FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol}, journal ={Systems, Second International Conference on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3105-2}, pages = {16-22}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICONS.2008.14}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Systems, Second International Conference on TI - FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol SN - 978-0-7695-3105-2 SP16 EP22 A1 - Yi Luo, A1 - D. Manivannan, PY - 2008 KW - Distributed systems KW - communication-induced checkpointing protocols KW - consistent global checkpoints VL - 0 JA - Systems, Second International Conference on ER -

Yi Luo

D. Manivannan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICONS.2008.14

In this paper, first we discuss two critical data structures used in the Communication-Induced Checkpointing (CIC) protocols and their distinct roles in guaranteeing Z-Cycle Free (ZCF) property by tracking the checkpoint and communication pattern (CCPAT) in a distributed computation that can lead to Z-cycles and preventing them. Then, we provide our Transitive Dependency Enabled TimeStamp (T DE_TS) mechanism by which we can both timestamp each event and get the transitive dependency information upon receiving a message. Finally, based on this timestamping mechanism, we present our Fully Informed aNd Efficient (FINE) checkpointing algorithm which can not only improve the performance of Fully Informed (FI) CIC protocol proposed by Helary et al. but also decrease the overhead of piggybacked information.

Index Terms:

Distributed systems, communication-induced checkpointing protocols, consistent global checkpoints

Citation:

Yi Luo, D. Manivannan, "FINE: A Fully Informed aNd Efficient Communication-Induced Checkpointing Protocol," icons, pp.16-22, Third International Conference on Systems (icons 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.