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.
|Title of host publication||Ubiquitous Information Technologies and Applications, CUTE 2012|
|Number of pages||9|
|Publication status||Published - 2013|
|Event||7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012 - Hong Kong, China|
Duration: 2012 Dec 20 → 2012 Dec 22
|Name||Lecture Notes in Electrical Engineering|
|Other||7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012|
|Period||12/12/20 → 12/12/22|
Bibliographical noteFunding Information:
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).
- Cloud computing
- Deadlock detection
- Gossip algorithm
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering