Concurrency control in real-time databases by dynamic adjustment of serialization order
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 104-112
- https://doi.org/10.1109/real.1990.128735
Abstract
A new concurrency control algorithm for real-time database systems is proposed, by which real-time scheduling and concurrency control can be integrated. The algorithm is founded on a priority-based locking mechanism to support time-critical scheduling by adjusting the serialization order dynamically in favor of high priority transactions. Furthermore, it does not assume any knowledge about the data requirements or execution time of each transaction, making the algorithm very practical.<>Keywords
This publication has 13 references indexed in Scilit:
- Experimental evaluation of real-time transaction processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Recovering imprecise transactions with real-time constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Performance evaluation of real-time locking protocols using a distributed software prototyping environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling real-time transactionsACM Transactions on Database Systems, 1992
- A real-time locking protocolIEEE Transactions on Computers, 1991
- On priority-based synchronization protocols for distributed real-time database systemsAnnual Review in Automatic Programming, 1990
- Replicated data management in distributed database systemsACM SIGMOD Record, 1988
- Concurrency control for distributed real-time databasesACM SIGMOD Record, 1988
- On real-time transactionsACM SIGMOD Record, 1988
- Concurrent Certifications by Intervals of Timestamps in Distributed Database SystemsIEEE Transactions on Software Engineering, 1987