Cautious transaction schedulers with admission control
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
Database concurrency control using data flow graphs
ACM Transactions on Database Systems (TODS)
The Performance of Flow Graph Locking
IEEE Transactions on Software Engineering
Performance Analysis of Static Locking in Distributed Database Systems
IEEE Transactions on Computers
Deadlock prevention in a distributed database system
ACM SIGMOD Record
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Software Engineering
Cost of Distributed Deadlock Detection: A Performance Study
Proceedings of the Sixth International Conference on Data Engineering
Performance Comparisons of Distributed Deadlock Detection Algorithms
Proceedings of the Eighth International Conference on Data Engineering
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Locking and Deadlock Detection in Distributed Data Bases
IEEE Transactions on Software Engineering
On Deadlock Detection in Distributed Systems
IEEE Transactions on Software Engineering
A Priority Based Distributed Deadlock Detection Algorithm
IEEE Transactions on Software Engineering
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
| Hi-index | 0.00 |
Concurrency control based on conventional techniques requires additional efforts for deadlock detection and elimination. The possibility of a deadlock is also connected to the introduction of delays, and repeated restarts of transactions in deadlock cycles. In the proposed approach, a technique for generation of data flow precedence graphs among transactions at data sites has been studied. The local access graph approach is a fully distributed approach. Through local computations, the approach can prevent deadlocks in a distributed system.