An unstructured termination detection algorithm using gossip in cloud computing environments

JongBeom Lim, Kwang Sik Chung, Joon Min Gil, Taeweon Suh, Heonchang Yu

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

4 Citations (Scopus)

Abstract

Determining termination in dynamic environments is hard due to node joining and leaving. In previous studies on termination detection, some structures, such as spanning tree or computational tree, are used. In this work, we present an unstructured termination detection algorithm, which uses a gossip based scheme to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain specific structures even when nodes join and leave during runtime. 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 an unstructured approach has a significant merit to solve scalability and fault-tolerance problems with lower message complexity 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)
Pages1-12
Number of pages12
Volume7767 LNCS
DOIs
Publication statusPublished - 2013 Feb 27
Event26th International Conference on Architecture of Computing Systems, ARCS 2013 - Prague, Czech Republic
Duration: 2013 Feb 192013 Feb 22

Publication series

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

Other

Other26th International Conference on Architecture of Computing Systems, ARCS 2013
CountryCzech Republic
CityPrague
Period13/2/1913/2/22

Fingerprint

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

Keywords

  • Cloud computing
  • Gossip
  • Termination detection
  • Unstructured algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lim, J., Chung, K. S., Gil, J. M., Suh, T., & Yu, H. (2013). An unstructured termination detection algorithm 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. 7767 LNCS, pp. 1-12). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7767 LNCS). https://doi.org/10.1007/978-3-642-36424-2_1

An unstructured termination detection algorithm using gossip in cloud computing environments. / Lim, JongBeom; Chung, Kwang Sik; Gil, Joon Min; Suh, Taeweon; Yu, Heonchang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7767 LNCS 2013. p. 1-12 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7767 LNCS).

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

Lim, J, Chung, KS, Gil, JM, Suh, T & Yu, H 2013, An unstructured termination detection algorithm 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. 7767 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7767 LNCS, pp. 1-12, 26th International Conference on Architecture of Computing Systems, ARCS 2013, Prague, Czech Republic, 13/2/19. https://doi.org/10.1007/978-3-642-36424-2_1
Lim J, Chung KS, Gil JM, Suh T, Yu H. An unstructured termination detection algorithm 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. 7767 LNCS. 2013. p. 1-12. (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-36424-2_1
Lim, JongBeom ; Chung, Kwang Sik ; Gil, Joon Min ; Suh, Taeweon ; Yu, Heonchang. / An unstructured termination detection algorithm using gossip in cloud computing environments. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7767 LNCS 2013. pp. 1-12 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0367c3805aca404cafe238675bc7ffc8,
title = "An unstructured termination detection algorithm using gossip in cloud computing environments",
abstract = "Determining termination in dynamic environments is hard due to node joining and leaving. In previous studies on termination detection, some structures, such as spanning tree or computational tree, are used. In this work, we present an unstructured termination detection algorithm, which uses a gossip based scheme to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain specific structures even when nodes join and leave during runtime. 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 an unstructured approach has a significant merit to solve scalability and fault-tolerance problems with lower message complexity over existing algorithms.",
keywords = "Cloud computing, Gossip, Termination detection, Unstructured algorithm",
author = "JongBeom Lim and Chung, {Kwang Sik} and Gil, {Joon Min} and Taeweon Suh and Heonchang Yu",
year = "2013",
month = "2",
day = "27",
doi = "10.1007/978-3-642-36424-2_1",
language = "English",
isbn = "9783642364235",
volume = "7767 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--12",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An unstructured termination detection algorithm using gossip in cloud computing environments

AU - Lim, JongBeom

AU - Chung, Kwang Sik

AU - Gil, Joon Min

AU - Suh, Taeweon

AU - Yu, Heonchang

PY - 2013/2/27

Y1 - 2013/2/27

N2 - Determining termination in dynamic environments is hard due to node joining and leaving. In previous studies on termination detection, some structures, such as spanning tree or computational tree, are used. In this work, we present an unstructured termination detection algorithm, which uses a gossip based scheme to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain specific structures even when nodes join and leave during runtime. 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 an unstructured approach has a significant merit to solve scalability and fault-tolerance problems with lower message complexity over existing algorithms.

AB - Determining termination in dynamic environments is hard due to node joining and leaving. In previous studies on termination detection, some structures, such as spanning tree or computational tree, are used. In this work, we present an unstructured termination detection algorithm, which uses a gossip based scheme to cope with scalability and fault-tolerance issues. This approach allows the algorithm not to maintain specific structures even when nodes join and leave during runtime. 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 an unstructured approach has a significant merit to solve scalability and fault-tolerance problems with lower message complexity over existing algorithms.

KW - Cloud computing

KW - Gossip

KW - Termination detection

KW - Unstructured algorithm

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

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

U2 - 10.1007/978-3-642-36424-2_1

DO - 10.1007/978-3-642-36424-2_1

M3 - Conference contribution

AN - SCOPUS:84874220569

SN - 9783642364235

VL - 7767 LNCS

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

SP - 1

EP - 12

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

ER -