A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
On timeout for global deadlock detection in decentralized database systems
Information Processing Letters
A Cost-Effective Approach to Deadlock Handling in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
The Presumed-Either Two-Phase Commit Protocol
IEEE Transactions on Knowledge and Data Engineering
Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases
IEEE Transactions on Computers
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
Concurrency control issues in grid databases
Future Generation Computer Systems - Special section: Data mining in grid computing environments
GLIP: A Concurrency Control Protocol for Clipping Indexing
IEEE Transactions on Knowledge and Data Engineering
Real-time transaction processing for autonomic Grid applications
Engineering Applications of Artificial Intelligence
Fuzzy sets and similarity relations for semantic web service matching
Computers & Mathematics with Applications
Local martingale difference approach for service selection with dynamic QoS
Computers & Mathematics with Applications
Comments on “Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems”
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.09 |
Transaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The locking mechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transactions try to lock shared resources in the unexpectable way due to the more randomicity of transaction requests, which has not been solved by existing research results. In this paper, we investigate how to prevent local deadlocks, caused by the resource competition among multiple sub-transactions of a global transaction, and global deadlocks from the competition among different global transactions. We propose a replication based approach to avoid the local deadlocks, and a timestamp based approach to significantly mitigate the global deadlocks. A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. Further, it is also proved that our approach provides higher system performance than traditional resource allocation schemes.