Abstract

Objects are concurrently manipulated by multiple transactions in object-based systems. We newly introduce availability and exclusion types of conflicting relations among methods. Then, we define a partially ordered relation on lock modes showing which modes are stronger than others. We newly propose a moderate locking (ML) protocol. Here, an object is initially locked in a weaker mode than an intrinsic mode of the method. Then, the lock mode is escalated to the method mode. The weaker the initial mode is, the higher concurrency is obtained but the more frequently deadlock occurs. The ML protocol is evaluated in terms of throughput and deadlock compared with the pessimistic and optimistic locking protocol.

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 call

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.