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
Modular Concurrency Control and Failure Recovery
IEEE Transactions on Computers
Real-time data acquisition at mission control
Communications of the ACM
Concurrent programming: principles and practice
Concurrent programming: principles and practice
Stack-based scheduling for realtime processes
Real-Time Systems
IEEE Transactions on Computers
Simple rational guidance for chopping up transactions
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
An overview of real-time database systems
Advances in real-time systems
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Multiversion concurrency control—theory and algorithms
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Ada-Europe '93 Proceedings of the 12th Ada-Europe International Conference
A Characterization of Re-execution Costs for Real-Time Abort-Oriented Protocols
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Real-time computing with lock-free shared objects
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Wait-free object-sharing schemes for real-time uniprocessors and multiprocessors
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
On avoiding remote blocking via real-time concurrency control protocols
Journal of Systems and Software
| Hi-index | 0.00 |
The problems of hard real-time systems scheduling involve not only guaranteeing schedulability but also ensuring that shared data will not be corrupted. Maintaining shared data consistency has long been studied in database systems. In this paper, we discuss the key differences between database concurrency control and concurrency control for hard real-time systems and describe an approach to adapting advanced concurrency control techniques to systems requiring analytic worst-case latency guarantees. We describe an example concurrency control technique which avoids interference between queries and updaters. The versioning technique can be implemented with simple and predictable low-overhead algorithms and data structures and its application to a task set is driven by the schedulability analysis. Performance evaluation results via case studies and simulation experiments are presented that show that the versioning technique can improve pure locking protocols in a variety of settings. In particular, when tasks are computation-intensive, the improvement made by the versioning technique in reducing worst-case blocking and increasing schedulability is most significant.