Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Data access scheduling in firm real-time database systems
Real-Time Systems - Special issue: real-time databases
Priority inheritance in soft real-time databases
Real-Time Systems - Special issue: real-time databases
Two-phase commit optimizations in a commercial distributed environment
Distributed and Parallel Databases
The PROMPT Real-Time Commit Protocol
IEEE Transactions on Parallel and Distributed Systems
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Scheduling Real-time Transactions: a Performance Evaluation
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A New Presumed Commit Optimization for Two Phase Commit
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Relaxed Atomic Commit for Real-Time Transactions in Mobile Computing Environment
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
Simulation of a complex distributed real-time database system
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
Adaptive speculative locking protocol for distributed real-time database systems
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
| Hi-index | 0.00 |
One-phase commit protocols substantially reduce the overheads of transaction commit processing, making them attractive for incorporation in distributed real-time databases. A major obstacle, however; is that these protocols significantly increase the occurrence of priority inversions. This arises from the cohorts of each distributed transaction being in a prepared state for extended periods of time, during which their data locks cannot be pre-empted. We present here a new one-phase real-time commit protocol, called PEp, that addresses the above-mentioned problem by suitably utilizing our previously proposed prepared data borrowing technique. Simulation-based evaluation of PEP for real-time applications with firm deadlines demonstrates that, for a variety of environments, it substantially reduces the number of killed transactions as compared to its multi-phase counterparts. In fact, PEP often provides better performance than even an equivalent centralized system.