Name
Title | ||
|---|---|---|
Unstructured deadlock detection technique with scalability and complexity-efficiency in clouds |
Abstract | ||
|---|---|---|
AbstractTo detect deadlock in distributed systems, the initiator should construct an efficient explicit or implicit global wait-for graph. In this paper, we present an unstructured deadlock detection algorithm using a gossip protocol in cloud computing environments, where constituting nodes may join and leave at any time. Because of the inherit properties of a gossip protocol, we argue that our proposed deadlock detection algorithm is scalable, fault-tolerant, and efficient, retaining safety and liveness properties. The correctness proof of the algorithm is also provided. The message complexity of our proposed algorithm is On, where n is the number of nodes. Our performance evaluation with scalable settings shows that our approach has a significant advantage over previous deadlock detection algorithms in terms of solving scalability, fault-tolerance, and complexity-efficiency issues. Copyright © 2013 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/dac.2638 | Periodicals |
Keywords | Field | DocType |
deadlock detection, unstructured algorithm, gossip protocol, cloud computing | Edge chasing,Computer science,Parallel computing,Deadlock,Wait-for graph,Gossip protocol,Deadlock prevention algorithms,Liveness,Scalability,Cloud computing,Distributed computing | Journal |
Volume | Issue | ISSN |
27 | 6 | 1074-5351 |
Citations | PageRank | References |
1 | 0.37 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| JongBeom Lim | 1 | 47 | 8.35 |
| Taeweon Suh | 2 | 171 | 22.47 |
| Heonchang Yu | 3 | 227 | 29.58 |