Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Invariant-based verification of a distributed deadlock detection algorithm
IEEE Transactions on Software Engineering
Seven good reasons for mobile agents
Communications of the ACM
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
Cost of Distributed Deadlock Detection: A Performance Study
Proceedings of the Sixth International Conference on Data Engineering
Checkpointing and Rollback of Wide-area Distributed Applications using Mobile Agents
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Distributed Deadlock Detection and Resolution using Probes, Tokens, and Barriers
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Integrating Java-based Mobile Agents into Web Servers under Security Concerns
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
A distributed algorithm for deadlock detection and resolution
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Protocols for Deadlock Detection in Distributed Database Systems
IEEE Transactions on Software Engineering
Mobile software agents: an overview
IEEE Communications Magazine
Hi-index | 0.00 |
Deadlock detection and resolution are of the fundamental issues in distributed systems. Although many algorithms have been proposed, these message passing based traditional solutions can hardly meet the challenges of the prevailing Internet computing and mobile computing. In this paper, we present a novel algorithm, namely the M-Guard, for deadlock detection and resolution in distributed systems based on mobile agent technology. The proposed algorithm lies in the intersection of the centralized type algorithm and the distributed type algorithm. An agent is employed in our algorithm as a guard with dual-role: when roaming in the system according to a specified itinerary algorithm, the agent collects resource request/allocation information for detecting deadlock cycles as well as propagating the collected network and resource information among the nodes. Consequently, accurate and timely detections of deadlocks can be made without any network node being the performance bottleneck. Preliminary simulation results show that, compared with several other algorithms, the M-Guard algorithm achieves both shorter deadlock persisting time and smaller phantom deadlock ratio. Moreover, the overall network communication overhead can be decreased, too.