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.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 31-45 |
| Number of pages | 15 |
| Volume | 7296 LNCS |
| DOIs | |
| Publication status | Published - 2012 May 22 |
| Event | 7th International Conference on Advances in Grid and Pervasive Computing, GPC 2012 - Hong Kong, China Duration: 2012 May 11 → 2012 May 13 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7296 LNCS |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 7th International Conference on Advances in Grid and Pervasive Computing, GPC 2012 |
|---|---|
| Country | China |
| City | Hong Kong |
| Period | 12/5/11 → 12/5/13 |
Fingerprint
Keywords
- Cloud Computing
- Gossip-based Algorithm
- Mutual Exclusion
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
A gossip-based mutual exclusion algorithm for cloud environments. / Lim, JongBeom; Chung, Kwang Sik; Chin, Sung Ho; Yu, Heonchang.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7296 LNCS 2012. p. 31-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7296 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A gossip-based mutual exclusion algorithm for cloud environments
AU - Lim, JongBeom
AU - Chung, Kwang Sik
AU - Chin, Sung Ho
AU - Yu, Heonchang
PY - 2012/5/22
Y1 - 2012/5/22
N2 - 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.
AB - 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.
KW - Cloud Computing
KW - Gossip-based Algorithm
KW - Mutual Exclusion
UR - http://www.scopus.com/inward/record.url?scp=84861175238&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861175238&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30767-6_3
DO - 10.1007/978-3-642-30767-6_3
M3 - Conference contribution
AN - SCOPUS:84861175238
SN - 9783642307669
VL - 7296 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 31
EP - 45
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -