FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Yi Luo; D. Manivannan

doi:10.1016/j.jpdc.2008.07.012

FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Yi Luo, D. Manivannan

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

30 Citas (Scopus)

Resumen

Communication-Induced Checkpointing (CIC) protocols are classified into two categories in the literature: Index-based and Model-based. In this paper, we discuss two data structures being used in these two kinds of CIC protocols, and their different roles in helping the checkpointing algorithms to enforce Z-cycle Free (ZCF) property. Then, we present our Fully Informed aNd Efficient (FINE) communication-induced checkpointing algorithm, which not only has less checkpointing overhead than the well-known Fully Informed (FI) CIC protocol proposed by Helary et al. but also has less message overhead. Performance evaluation indicates that our protocol performs better than many of the other existing CIC protocols.

Idioma original	English
Páginas (desde-hasta)	153-167
Número de páginas	15
Publicación	Journal of Parallel and Distributed Computing
Volumen	69
N.º	2
DOI	https://doi.org/10.1016/j.jpdc.2008.07.012
Estado	Published - feb 2009

Nota bibliográfica

Funding Information:
A preliminary version of this paper [15] has been presented in the International Conference on Systems (ICONS’08). This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791. 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.

Funding Information:
D. Manivannan is currently an associate professor in the Department of Computer Science at the University of Kentucky, Lexington, USA. Dr. Manivannan received the Ph.D. degree in Computer and Information Science from The Ohio State University, Columbus, Ohio, in 1997. His areas of research interests include fault-tolerance and synchronization in distributed systems, routing in wormhole networks, channel allocation in cellular networks and wireless networks. He served as program committee member for several International Conferences and also served as reviewer for several International Journals published by ACM, IEEE, Elsevier, Springer, Oxford University Press and others. He is on the Editorial Board of Information Sciences journal, published by Elsevier and Wireless Personal Communications journal, published by Springer. He is also an Associate Technical Editor for IEEE Communications Magazine. Information about his publications and research can be found at his lab site http://dmcslab.netlab.uky.edu/ . Dr. Manivannan is a recipient of the CAREER Award from the US National Science Foundation. He is a senior member of the ACM, and a member of ACM SIGMOBILE, IEEE, and IEEE Computer Society.

Financiación

A preliminary version of this paper [15] has been presented in the International Conference on Systems (ICONS’08). This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791. 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. D. Manivannan is currently an associate professor in the Department of Computer Science at the University of Kentucky, Lexington, USA. Dr. Manivannan received the Ph.D. degree in Computer and Information Science from The Ohio State University, Columbus, Ohio, in 1997. His areas of research interests include fault-tolerance and synchronization in distributed systems, routing in wormhole networks, channel allocation in cellular networks and wireless networks. He served as program committee member for several International Conferences and also served as reviewer for several International Journals published by ACM, IEEE, Elsevier, Springer, Oxford University Press and others. He is on the Editorial Board of Information Sciences journal, published by Elsevier and Wireless Personal Communications journal, published by Springer. He is also an Associate Technical Editor for IEEE Communications Magazine. Information about his publications and research can be found at his lab site http://dmcslab.netlab.uky.edu/ . Dr. Manivannan is a recipient of the CAREER Award from the US National Science Foundation. He is a senior member of the ACM, and a member of ACM SIGMOBILE, IEEE, and IEEE Computer Society.

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

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Acceder al documento

10.1016/j.jpdc.2008.07.012

Otros archivos y enlaces

Citar esto

@article{b432dd104f9744f682f27fb5865dff2d,

title = "FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems",

abstract = "Communication-Induced Checkpointing (CIC) protocols are classified into two categories in the literature: Index-based and Model-based. In this paper, we discuss two data structures being used in these two kinds of CIC protocols, and their different roles in helping the checkpointing algorithms to enforce Z-cycle Free (ZCF) property. Then, we present our Fully Informed aNd Efficient (FINE) communication-induced checkpointing algorithm, which not only has less checkpointing overhead than the well-known Fully Informed (FI) CIC protocol proposed by Helary et al. but also has less message overhead. Performance evaluation indicates that our protocol performs better than many of the other existing CIC protocols.",

keywords = "Communication-induced checkpointing protocols, Consistent global checkpoints, Distributed systems",

author = "Yi Luo and D. Manivannan",

note = "Funding Information: A preliminary version of this paper [15] has been presented in the International Conference on Systems (ICONS{\textquoteright}08). This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791. 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. Funding Information: D. Manivannan is currently an associate professor in the Department of Computer Science at the University of Kentucky, Lexington, USA. Dr. Manivannan received the Ph.D. degree in Computer and Information Science from The Ohio State University, Columbus, Ohio, in 1997. His areas of research interests include fault-tolerance and synchronization in distributed systems, routing in wormhole networks, channel allocation in cellular networks and wireless networks. He served as program committee member for several International Conferences and also served as reviewer for several International Journals published by ACM, IEEE, Elsevier, Springer, Oxford University Press and others. He is on the Editorial Board of Information Sciences journal, published by Elsevier and Wireless Personal Communications journal, published by Springer. He is also an Associate Technical Editor for IEEE Communications Magazine. Information about his publications and research can be found at his lab site http://dmcslab.netlab.uky.edu/ . Dr. Manivannan is a recipient of the CAREER Award from the US National Science Foundation. He is a senior member of the ACM, and a member of ACM SIGMOBILE, IEEE, and IEEE Computer Society.",

year = "2009",

month = feb,

doi = "10.1016/j.jpdc.2008.07.012",

language = "English",

volume = "69",

pages = "153--167",

number = "2",

}

TY - JOUR

T1 - FINE

T2 - A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

AU - Luo, Yi

AU - Manivannan, D.

N1 - Funding Information: A preliminary version of this paper [15] has been presented in the International Conference on Systems (ICONS’08). This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791. 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. Funding Information: D. Manivannan is currently an associate professor in the Department of Computer Science at the University of Kentucky, Lexington, USA. Dr. Manivannan received the Ph.D. degree in Computer and Information Science from The Ohio State University, Columbus, Ohio, in 1997. His areas of research interests include fault-tolerance and synchronization in distributed systems, routing in wormhole networks, channel allocation in cellular networks and wireless networks. He served as program committee member for several International Conferences and also served as reviewer for several International Journals published by ACM, IEEE, Elsevier, Springer, Oxford University Press and others. He is on the Editorial Board of Information Sciences journal, published by Elsevier and Wireless Personal Communications journal, published by Springer. He is also an Associate Technical Editor for IEEE Communications Magazine. Information about his publications and research can be found at his lab site http://dmcslab.netlab.uky.edu/ . Dr. Manivannan is a recipient of the CAREER Award from the US National Science Foundation. He is a senior member of the ACM, and a member of ACM SIGMOBILE, IEEE, and IEEE Computer Society.

PY - 2009/2

Y1 - 2009/2

N2 - Communication-Induced Checkpointing (CIC) protocols are classified into two categories in the literature: Index-based and Model-based. In this paper, we discuss two data structures being used in these two kinds of CIC protocols, and their different roles in helping the checkpointing algorithms to enforce Z-cycle Free (ZCF) property. Then, we present our Fully Informed aNd Efficient (FINE) communication-induced checkpointing algorithm, which not only has less checkpointing overhead than the well-known Fully Informed (FI) CIC protocol proposed by Helary et al. but also has less message overhead. Performance evaluation indicates that our protocol performs better than many of the other existing CIC protocols.

AB - Communication-Induced Checkpointing (CIC) protocols are classified into two categories in the literature: Index-based and Model-based. In this paper, we discuss two data structures being used in these two kinds of CIC protocols, and their different roles in helping the checkpointing algorithms to enforce Z-cycle Free (ZCF) property. Then, we present our Fully Informed aNd Efficient (FINE) communication-induced checkpointing algorithm, which not only has less checkpointing overhead than the well-known Fully Informed (FI) CIC protocol proposed by Helary et al. but also has less message overhead. Performance evaluation indicates that our protocol performs better than many of the other existing CIC protocols.

KW - Communication-induced checkpointing protocols

KW - Consistent global checkpoints

KW - Distributed systems

UR - http://www.scopus.com/inward/record.url?scp=57949085347&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57949085347&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2008.07.012

DO - 10.1016/j.jpdc.2008.07.012

M3 - Article

AN - SCOPUS:57949085347

SN - 0743-7315

VL - 69

SP - 153

EP - 167

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 2

ER -

FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto