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.
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No. 2011-0026210).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3, 344–349 (1985)
Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)
Mizuno, M., Neilsen, M.L., Rao, R.: A token based distributed mutual exclusion algorithm based on quorum agreements. In: 11th International Conference on Distributed Computing Systems, pp. 361–368 (1991)
Neilsen, M.L., Mizuno, M.: A DAG-based algorithm for distributed mutual exclusion. In: 11th International Conference on Distributed Computing Systems, pp. 354–360 (1991)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 558–565 (1978)
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24, 9–17 (1981)
Singhal, M.: A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems. IEEE Trans. Parallel Distrib. Syst. 3, 121–125 (1992)
Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems 11, 537–549 (2000)
Maekawa, M.: A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3, 145–159 (1985)
Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9, 1–20 (1991)
Joung, Y.-J.: Asynchronous group mutual exclusion. Distrib. Comput. 13, 189–206 (2000)
Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52, 139–149 (2003)
Allavena, A., Demers, A., Hopcroft, J.E.: Correctness of a gossip based membership protocol. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 292–301. ACM, Las Vegas (2005)
Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 151–160. ACM, Calgary (2009)
Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: HiScamp: self-organizing hierarchical membership protocol. In: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, pp. 133–139. ACM, Saint-Emilion (2002)
Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management 13, 197–217 (2005)
Matos, M., Sousa, A., Pereira, J., Oliveira, R., Deliot, E., Murray, P.: CLON: Overlay Networks and Gossip Protocols for Cloud Environments. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2009. LNCS, vol. 5870, pp. 549–566. Springer, Heidelberg (2009)
Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: Gossip-based fast overlay topology construction. Comput. Netw. 53, 2321–2339 (2009)
Lim, J.B., Lee, J.H., Chin, S.H., Yu, H.C.: Group-Based Gossip Multicast Protocol for Efficient and Fault Tolerant Message Dissemination in Clouds. In: Riekki, J., Ylianttila, M., Guo, M. (eds.) GPC 2011. LNCS, vol. 6646, pp. 13–22. Springer, Heidelberg (2011)
Iwanicki, K., van Steen, M., Voulgaris, S.: Gossip-Based Clock Synchronization for Large Decentralized Systems. In: Keller, A., Martin-Flatin, J.-P. (eds.) SelfMan 2006. LNCS, vol. 3996, pp. 28–42. Springer, Heidelberg (2006)
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)
Montresor, A., Jelasity, M.: PeerSim: A scalable P2P simulator. In: IEEE Ninth International Conference on Peer-to-Peer Computing, P2P 2009, pp. 99–100 (2009)
Newman, M.: Networks: An Introduction. Oxford University Press, Inc., New York (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, J., Chung, KS., Chin, SH., Yu, HC. (2012). A Gossip-Based Mutual Exclusion Algorithm for Cloud Environments. In: Li, R., Cao, J., Bourgeois, J. (eds) Advances in Grid and Pervasive Computing. GPC 2012. Lecture Notes in Computer Science, vol 7296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30767-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-30767-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30766-9
Online ISBN: 978-3-642-30767-6
eBook Packages: Computer ScienceComputer Science (R0)