A gossip-based mutual exclusion algorithm for cloud environments

  • Authors:
  • JongBeom Lim;Kwang-Sik Chung;Sung-Ho Chin;Heon-Chang Yu

  • Affiliations:
  • Department of Computer Science Education, Korea University, South Korea;Department of Computer Science, Korea National Open University, Korea;Software Platform Laboratory, CTO Division, LG Electronics, Seoul, Korea;Department of Computer Science Education, Korea University, South Korea

  • Venue:
  • GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.