Abstract
In this paper some commonly used concurrency control protocols have been implemented through simulation. It is well known that the transactions have mainly four properties: atomicity, consistency, isolation and durability, which are known as the ACID properties. The objective of concurrency control is to ensure consistency when a shared database is updated by multiple concurrent transactions. It is also used to increase the database object utilization. Among all the existing concurrency control protocols, standards are locking, two phase locking, graph based protocols, time stamp-based protocol, wait-die scheme and wound-wait scheme. This paper analyze implementation of two phase locking, wait-die and wound-wait schemes. To implement these protocols, a PC based model has been developed first. The outcome of the model is quite satisfactory. The relative performance of those protocols has been compared in terms of utilization. For each protocol a concurrency control manager has been designated which maintains all lock buffers, detects deadlock, and takes necessary action for deadlock recovery. Analyzing the whole experiment it is clear that wait-die scheme and wound-wait scheme protocols show better performance than two phases locking.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer and Electrical Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
