Abstract
In this paper we have proposed a new concurrency control algorithm that consists of two phases of execution for centralized multiprocessor-based transaction processing systems. The proposed algorithm integrates optimistic concurrency control with back-shifting with pre-claimed locking schemes into two phases. It guarantees transactions to commit in two executions if access invariance holds for the second run. It also can offer superior performance than the existing concurrency algorithms by reduce the probability of aborts in the first phase, minimize the probability of blocking due to validation and the possible second phase. Furthermore, it is deadlock-free.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rererence
Kung and Robinson, “On Optimistic Methods for Concurrency Control,” ACM TODS 6 (2), 1981, 213–226.
Yu and Dias, “Performance Analysis of Optimistic Concurrency Control Schemes for Systems with Large Memory,” Proc. ACM SIGMETRICS Conference, 1989.
Franazek, Robinson, and Thomasian “Access Invariance and Its Use in High Contention Environments,” Proc International Conf. on Data Engineering, 1990, 47–55.
Yu and Dias, “Concurrency Control Using Locking with Deferred Blocking,” Proc. Inter. Conf. on Data Engineering, 1990, 30–36.
Robinson, “Design of Concurrency Controls for Transaction Processing Systems,” Ph.D. thesis, tech. report, CMU-CS-82–114, CMU, 1982.
Wang and Li, “The Precedence-agreement for Distributed Database Concurrency Control algorithms,” Proc. ACM Symp. Principles of Database Systems, 1987, 119–128.
Agrawal, Carey, and Ltvny, “Concurrency Control Performance Modeling: Alternatives and Implications,” ACM TODS 12 (4), 609–654.
Gray, Lorie, Putzolu, “Granularity of Locks in a Shared Data Base,” Proc. International Conf. on Very Large Data Bases, 1975, 428–451.
Reuter, “The Transaction Pipeline Processor,” Proc, International Workshop on High Performance Transaction Systems, 1985.
Franaszek and Robinson, “Limitations of Concrrency in Transaction Processing,’ ACM TODS. March, 1985, 1–28.
Holt, ‘Some deadlock Properties in Computer Systems.’ ACM Computing Surveys 4 (3), 1972, 179–196.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag/Wien
About this chapter
Cite this chapter
Wang, S., Gagliardi, U.O. (1990). A High Performance Concurrency Control Protocol for Multi-Processor Transaction Processing Systems. In: Tjoa, A.M., Wagner, R. (eds) Database and Expert Systems Applications. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7553-8_71
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7553-8_71
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82234-0
Online ISBN: 978-3-7091-7553-8
eBook Packages: Springer Book Archive