Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control for distributed real-time databases
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
IEEE Transactions on Computers
On being optimistic about real-time constraints
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Advances in real-time database systems research
ACM SIGMOD Record
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Performance Characteristics of Epsilon Serializability with Hierarchical Inconsistency Bounds
Proceedings of the Ninth International Conference on Data Engineering
Scheduling Real-time Transactions: a Performance Evaluation
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Supporting predictability in real-time database systems
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
A semantic-based concurrency control protocol for real-time transactions
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
A pre-emptive transaction scheduling protocol for controlling priority inversion
RTCSA '96 Proceedings of the Third International Workshop on Real-Time Computing Systems Application
Scheduling transactions with temporal constraints: exploiting data semantics
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Using Separate Algorithms to Process Read-Only Transactions in Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A quantification of aborting effect for real-time data accesses
IEEE Transactions on Computers
Selective early request termination for busy internet services
Proceedings of the 15th international conference on World Wide Web
| Hi-index | 14.98 |
There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions and a concurrency control algorithm must attempt to meet the deadlines as well as preserve data consistency. This paper proposes a class of simple and efficient abort-oriented concurrency control algorithms in which the schedulability of a transaction system is improved by aborting transactions that introduce excessive blockings. We consider different levels of the aborting relationship among transactions and evaluate the impacts of the aborting relationship when the relationship is built in an online or offline fashion. We measure aborting overheads on a system running the LynxOS real time operating system. The strengths of the work are demonstrated by improving the worst-case schedulability of an avionics example [20], a satellite control system [7], and randomly generated transaction sets.