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
The Performance of Flow Graph Locking
IEEE Transactions on Software Engineering
Performance Analysis of Static Locking in Distributed Database Systems
IEEE Transactions on Computers
Performance Analysis of Dynamic Locking with the No-Waiting Policy
IEEE Transactions on Software Engineering
Deadlock prevention in a distributed database system
ACM SIGMOD Record
On characterization and correctness of distributed deadlock detection
Journal of Parallel and Distributed Computing
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Replication and consistency: being lazy helps sometimes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The need for distributed asynchronous transactions
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Cost of Distributed Deadlock Detection: A Performance Study
Proceedings of the Sixth International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Executing Serializable Transactions within a Hard Real-time Database System
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Asynchronous Transaction Processing for Updates by Client: With Elimination of Wait-for State
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Asynchronous Backup and Initialization of a Database Server for Replicated Database Systems
The Journal of Supercomputing
High performance scientific and engineering computing
Parallel Concurrency Control Activity for Transaction Management in Real-time Database Systems
The Journal of Supercomputing
International Journal of Computers and Applications
Performance considerations of embedded computations in distributed databases
Journal of Embedded Computing
Elimination of non-deterministic delays in a real-time database system
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Synchronization and recovery in an embedded database system for read-only transactions
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Parallelizing serializable transactions within distributed real-time database systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed 驴edge detection驴 approach, a graph-based resolution of access conflicts has been adopted. The technique generates a uniform wait-for precedence order at distributed sites for transactions to execute. The earlier methods based on serialization graph testing are difficult to implement in a distributed environment. The edge detection approach is a fully distributed approach. It presents a unified technique for locking and deadlock detection exercises. The technique eliminates many deadlocks without incurring message overheads.