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 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
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
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
Database Systems Concepts
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Asynchronous Operations in Distributed Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Executing Serializable Transactions within a Hard Real-time Database System
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Performance considerations of embedded computations in distributed databases
Journal of Embedded Computing
Hi-index | 0.00 |
In a real-time database system, the conventional method of transaction method can not be used. In these methods, the deadlock detection is based on (a) use of delay to cause and watch deadlocks, (b) high overheads of periodic checking (c) Non-deterministic nature of the delays, and lastly, (d) difficulties to scale up the existing solutions (centralized). The proposal is based on enhanced local processing and peer-to-peer (P2P) communication for distributed transaction process. The earlier procedures incorporate additional steps for handling wait-for states and deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. These methods introduce a centralized computation at source (for each occurrence of a delay). The proposal introduces asynchronous operations in transaction processing. As a result the detection processes do not wait for occurrences of delays (time-out). These start the delay elimination process instantaneously. The technique incurs low overheads and eliminates the possibility of occurrence of waiting.