Jayant R. Haritsa
Michael J. Carey
ABSTRACT
Performance studies of concurrency control algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic techniques. Real-time database systems have special characteristics - timing constraints are associated with transactions, performance criteria are based on satisfaction of these timing constraints, and scheduling algorithms are priority driven. In light of these special characteristics, results regarding the performance of concurrency control algorithms need to be re-evaluated. We show in this paper that the following parameters of the real-time database system - its policy for dealing with transactions whose constraints are not met, its knowledge of transaction resource requirements, and the availability of resources - have a significant impact on the relative performance of the concurrency control algorithms. In particular, we demonstrate that under a policy that discards transactions whose constraints are not met, optimistic concurrency control outperforms locking over a wide range of system utilization. We also outline why, for a variety of reasons, optimistic algorithms appear well-suited to real-time database systems.
- Abbo88.Abbott, R., and Garcia-Molina, H., "Scheduling Real-Time Transactions : a Performance Evaluation," Proc. of the 14th Conference on Very Large Database Systems, Aug. 1988. Google Scholar
Digital Library
- Abbo89.Abbott, R., and Garcia-Molina, H., "Scheduling Real-Time Transactions with Disk Resident Data," Proc. of the 15th Conference on Very Large Database Systems, Aug. 1989. Google ScholarDigital Library
- Agra87.Agrawal, R., Carry, M., and Livny,M., "Concurrency Control Performance Modeling: Alternatives and Implications," ACM Trans. on Database Systems, Dec. 1987. Google ScholarDigital Library
- Care88.Carry, M., and Livny, M., "Distributed Concurrency Control Performance : A Study of Algorithms, Distribution, and Replication," Proc. of the 14th Conference on Very Large Database Systems, Aug. 1988. Google ScholarDigital Library
- Care89.Caxey, M., Jauhari, R., and Livny, M., "Priority in DBMS Resource Scheduling," Proc. of the 15th Conference on Very large Database Systems, Aug. 1989. Google ScholarDigital Library
- Eswa76.Eswaran, K., Gray, J., Lode, R., and Traiger, I., "rile Notions of Consistency and Predicate Locks in a Database System," Conmmnications of the ACM , Nov. 1976. Google ScholarDigital Library
- Kung81.Kung, H., and Robinson, L, "On Optimistic Methods for Concurrency Control," ACM Trans. on Database Systems, June 1981. Google ScholarDigital Library
- Livn88.Livny, M., DeNet User's Guide, Version 1.0, Comp. Sei. Dept., Univ. of Wisconsin, Madison, 1988.Google Scholar
- Mena82.Menasce, D., and Nakanishi, T., "Optimistic versus Pessimistic Concurrency Control Mechanisms in Database Management Systems," Information Systems, vol. 7-I, 1982.Google Scholar
- Robi82.Robinson, J., "Design of Concurrency Controls for Transaction Processing Systems," Ph.D. Thesis, Carnegie Mellon University, 1982. Google ScholarDigital Library
- Sha87.Sha, L., Rajkumar, R., and Lehoczl~, J., "Priority Inheritance Protocols: An Approach to Real-Time Synchronization," Tech. Report No. CMU-CS-87-181, Carnegie Mellon University, Dec. 1987.Google Scholar
- Jack63.Jackson, J.R., "Jobshop-like Queuing Systems," Management Science, No. 10-1, Oct. 1963.Google Scholar
- Klei75.Kleinroek, L., "Queueing Systems," Vol. I, John Wiley & Sons, New York. Google ScholarDigital Library
Index Terms
- On being optimistic about real-time constraints
Recommendations
Optimistic concurrency control in firm real-time databases
IWDC'05: Proceedings of the 7th international conference on Distributed ComputingConcurrency control algorithms for real-time database systems satisfy not only consistency requirements but also meet transaction-timing constraints. Two Phase Locking (2PL) is used often in traditional database systems. However, it has some inherent ...
Real-time optimistic concurrency control protocol with dynamic adjustment of serialization order
RTAS '95: Proceedings of the Real-Time Technology and Applications SymposiumProposes a new real-time optimistic protocol. By using a dynamic adjustment of the serialization order by backward-adjusting the non-serious conflicting transactions before the committing transactions, many unnecessary restarts can be eliminated. In the ...
Comments