@inproceedings{b1819e86db28442fab7e45bece718fa2,
title = "A gossip-based mutual exclusion algorithm for cloud environments",
abstract = "Mutual exclusion is a salient feature in distributed computing systems whereby concurrent access of processors to a shared resource is granted in a mutually exclusive manner. The primary aim of this study is to investigate the use of a gossip protocol to a mutual exclusion algorithm to cope with scalability and fault-tolerance problems which are fundamental issues for cloud computing systems. In this paper we present a gossip-based mutual exclusion algorithm for cloud computing systems with dynamic membership behavior. The correctness proof of the algorithm is provided. The amortized message complexity of our algorithm is O(n), where n is the number of nodes. Simulation results show that our proposed algorithm is attractive regarding dynamic membership behavior.",
keywords = "Cloud Computing, Gossip-based Algorithm, Mutual Exclusion",
author = "Lim, {Jong Beom} and Chung, {Kwang Sik} and Chin, {Sung Ho} and Yu, {Heon Chang}",
year = "2012",
doi = "10.1007/978-3-642-30767-6_3",
language = "English",
isbn = "9783642307669",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "31--45",
booktitle = "Advances in Grid and Pervasive Computing - 7th International Conference, GPC 2012, Proceedings",
note = "7th International Conference on Advances in Grid and Pervasive Computing, GPC 2012 ; Conference date: 11-05-2012 Through 13-05-2012",
}