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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551370
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 10:36:17 AM
Last modification on : Friday, December 1, 2017 - 1:09:55 AM
Document(s) archivé(s) le : Monday, January 22, 2018 - 9:05:20 PM

File

978-3-642-35606-3_51_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Jongbeom Lim, Kwang-Sik Chung, Heon-Chang Yu. A Termination Detection Technique Using Gossip in Cloud Computing Environments. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.429-436, ⟨10.1007/978-3-642-35606-3_51⟩. ⟨hal-01551370⟩

Share

Metrics

Record views

265

Files downloads

54