Abstract
This paper proposes a real-time concurrency control protocol called Reduced Ceiling Protocol (RCP) for database systems consisting of hard and soft real-time transactions. In the RCP, the schedulability of hard real-time transactions is guaranteed by reserving the data items for them and by eliminating the blocking time from soft real-time transactions. Different concurrency control strategies are used to resolve the data conflicts between different combinations of hard and soft real-time transactions. We have shown the characteristics of the schedules generated from the RCP. Simulation experiments have been performed to study the performance of the RCP as compared with the optimistic concurrency control with broadcast commit (OCC-BC). It has been found that the RCP can guarantee the performance of the hard real-time transactions and at the same time reduce the number of deadline missing of the soft real-time transactions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
