A Deadlock Detection Algorithm Using Gossip in Cloud Computing Environments

  • JongBeom Lim
  • TaeWeon Suh
  • HeonChang Yu
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 214)


To detection deadlock in distributed systems, the initiator should construct a global wait-for graph in an efficient way. In this paper, we present a deadlock detection algorithm using gossip for cloud computing environments where each node may leave and join at any time. Due to its inherit properties of a gossip protocol, we claim that our proposed deadlock detection algorithm is scalable and fault-tolerant. The amortized message complexity of our proposed algorithm is O(n), where n is the number of nodes. Our evaluation over scalable settings shows that our approach has a significant merit to solve scalability and fault-tolerance problems over existing algorithms.


Deadlock detection Gossip algorithm Cloud computing 


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. 2012-0007429).


  1. 1.
    Menasce, D.A., Muntz, R.R.: Locking and deadlock detection in distributed data bases. IEEE Transact. Softw. Eng. SE-5, 195–202 (1979)Google Scholar
  2. 2.
    Chandy, K.M., Misra, J., Haas, L.M.: Distributed deadlock detection. ACM Trans. Comput. Syst. 1, 144–156 (1983)CrossRefGoogle Scholar
  3. 3.
    Mitchell, D.P., Merritt, M.J.: A distributed algorithm for deadlock detection and resolution. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 282–284. ACM, Vancouver, British Columbia, Canada (1984)Google Scholar
  4. 4.
    Kshemkalyani, A.D., Singhal, M.: Efficient detection and resolution of generalized distributed deadlocks. IEEE Trans. Softw. Eng. 20, 43–54 (1994)CrossRefGoogle Scholar
  5. 5.
    Lee, S.: Fast, centralized detection and resolution of distributed deadlocks in the generalized model. IEEE Trans. Softw. Eng. 30, 561–573 (2004)CrossRefGoogle Scholar
  6. 6.
    Srinivasan, S., Rajaram, R.: A decentralized deadlock detection and resolution algorithm for generalized model in distributed systems. Distrib. Parallel Databases 29, 261–276 (2011)CrossRefGoogle Scholar
  7. 7.
    Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52, 139–149 (2003)CrossRefGoogle Scholar
  8. 8.
    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, NV, USA (2005)Google Scholar
  9. 9.
    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, AB, Canada (2009)Google Scholar
  10. 10.
    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, France (2002)Google Scholar
  11. 11.
    Voulgaris, S., Gavidia, D., van Steen, M.: CYCLON: inexpensive membership management for unstructured P2P overlays. J. Netw. Syst. Manage. 13, 197–217 (2005)CrossRefGoogle Scholar
  12. 12.
    Matos, M., Sousa, A., Pereira, J., Oliveira, R., Deliot, E., Murray, P.: CLON: overlay networks and gossip protocols for cloud environments. In: Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on the Move to Meaningful Internet Systems: Part I, pp. 549–566. Springer, Vilamoura, Portugal (2009)Google Scholar
  13. 13.
    Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: gossip-based fast overlay topology construction. Comput. Netw. 53, 2321–2339 (2009)MATHCrossRefGoogle Scholar
  14. 14.
    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: Proceedings of the 6th International Conference on Advances in Grid and Pervasive Computing, pp. 13–22. Springer, Oulu, Finland (2011)Google Scholar
  15. 15.
    Iwanicki, K., Steen, M.V., Voulgaris, S.: Gossip-based clock synchronization for large de-centralized systems. In: Proceedings of the Second IEEE International Conference On Self-Managed Networks, Systems, and Services, pp. 28–42. Springer, Dublin, Ireland (2006)Google Scholar
  16. 16.
    Jelasity, M., Guerraoui, R., Kermarrec, A.-M., Steen, M.V.: The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, pp. 79–98. Springer, New York, Toronto, Canada (2004)Google Scholar
  17. 17.
    Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: IEEE Ninth International Conference on Peer-to-Peer Computing, P2P ‘09, pp. 99–100 (2009)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer Science EducationKorea UniversitySeoulKorea

Personalised recommendations