A termination detection technique using gossip in cloud computing environments

JongBeom Lim, Kwang Sik Chung, Heonchang Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Termination detection is a fundamental problem in distributed systems. In previous research, some structures are used (e.g., spanning tree or computational tree) to detect termination. In this work, we present an unstructured termination detection algorithm, which uses a gossip based algorithm to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain structures during runtime due to node joining and leaving. These dynamic behaviors are prevalent in cloud computing environments and little attention has been paid by existing approaches. To measure the complexity of our proposed algorithm, a new metric, self-centered message complexity is used. Our evaluation over scalable settings shows that the unstructured approach can have a significant merit on performance over existing algorithms.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages429-436
Number of pages8
Volume7513 LNCS
DOIs
Publication statusPublished - 2012 Dec 31
Event9th IFIP International Conference on Network and Parallel Computing, NPC 2012 - Gwangju, Korea, Republic of
Duration: 2012 Sep 62012 Sep 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7513 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th IFIP International Conference on Network and Parallel Computing, NPC 2012
CountryKorea, Republic of
CityGwangju
Period12/9/612/9/8

Fingerprint

Gossip
Cloud computing
Cloud Computing
Termination
Message Complexity
Fault tolerance
Spanning tree
Fault Tolerance
Joining
Dynamic Behavior
Scalability
Distributed Systems
Metric
Evaluation
Vertex of a graph

Keywords

  • Cloud computing
  • Gossip algorithm
  • Termination detection

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lim, J., Chung, K. S., & Yu, H. (2012). A termination detection technique using gossip in cloud computing environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7513 LNCS, pp. 429-436). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7513 LNCS). https://doi.org/10.1007/978-3-642-35606-3_51

A termination detection technique using gossip in cloud computing environments. / Lim, JongBeom; Chung, Kwang Sik; Yu, Heonchang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7513 LNCS 2012. p. 429-436 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7513 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lim, J, Chung, KS & Yu, H 2012, A termination detection technique using gossip in cloud computing environments. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7513 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7513 LNCS, pp. 429-436, 9th IFIP International Conference on Network and Parallel Computing, NPC 2012, Gwangju, Korea, Republic of, 12/9/6. https://doi.org/10.1007/978-3-642-35606-3_51
Lim J, Chung KS, Yu H. A termination detection technique using gossip in cloud computing environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7513 LNCS. 2012. p. 429-436. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-35606-3_51
Lim, JongBeom ; Chung, Kwang Sik ; Yu, Heonchang. / A termination detection technique using gossip in cloud computing environments. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7513 LNCS 2012. pp. 429-436 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{97f16a93b0754dee97921650190a657a,
title = "A termination detection technique using gossip in cloud computing environments",
abstract = "Termination detection is a fundamental problem in distributed systems. In previous research, some structures are used (e.g., spanning tree or computational tree) to detect termination. In this work, we present an unstructured termination detection algorithm, which uses a gossip based algorithm to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain structures during runtime due to node joining and leaving. These dynamic behaviors are prevalent in cloud computing environments and little attention has been paid by existing approaches. To measure the complexity of our proposed algorithm, a new metric, self-centered message complexity is used. Our evaluation over scalable settings shows that the unstructured approach can have a significant merit on performance over existing algorithms.",
keywords = "Cloud computing, Gossip algorithm, Termination detection",
author = "JongBeom Lim and Chung, {Kwang Sik} and Heonchang Yu",
year = "2012",
month = "12",
day = "31",
doi = "10.1007/978-3-642-35606-3_51",
language = "English",
isbn = "9783642356056",
volume = "7513 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "429--436",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A termination detection technique using gossip in cloud computing environments

AU - Lim, JongBeom

AU - Chung, Kwang Sik

AU - Yu, Heonchang

PY - 2012/12/31

Y1 - 2012/12/31

N2 - Termination detection is a fundamental problem in distributed systems. In previous research, some structures are used (e.g., spanning tree or computational tree) to detect termination. In this work, we present an unstructured termination detection algorithm, which uses a gossip based algorithm to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain structures during runtime due to node joining and leaving. These dynamic behaviors are prevalent in cloud computing environments and little attention has been paid by existing approaches. To measure the complexity of our proposed algorithm, a new metric, self-centered message complexity is used. Our evaluation over scalable settings shows that the unstructured approach can have a significant merit on performance over existing algorithms.

AB - Termination detection is a fundamental problem in distributed systems. In previous research, some structures are used (e.g., spanning tree or computational tree) to detect termination. In this work, we present an unstructured termination detection algorithm, which uses a gossip based algorithm to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain structures during runtime due to node joining and leaving. These dynamic behaviors are prevalent in cloud computing environments and little attention has been paid by existing approaches. To measure the complexity of our proposed algorithm, a new metric, self-centered message complexity is used. Our evaluation over scalable settings shows that the unstructured approach can have a significant merit on performance over existing algorithms.

KW - Cloud computing

KW - Gossip algorithm

KW - Termination detection

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

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

U2 - 10.1007/978-3-642-35606-3_51

DO - 10.1007/978-3-642-35606-3_51

M3 - Conference contribution

AN - SCOPUS:84871550196

SN - 9783642356056

VL - 7513 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 429

EP - 436

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -