Concurrency Control in Resilient Objects
Ken Birman, Thomas Joseph, Thomas Raeuchle · eCommons (Cornell University) · 1984
Resilient objects are instances of distributed abstract data types that are tolerant to failures. Due to the distributed nature of resilient objects and the use of replicated data, the potential for a high degree of concurrency exists within them. This paper introduces a new concurrency control algorithm which achieves higher concurrency than conventional methods like two-phase locking. Objects are specified in a high level language. The algorithm uses the specification taking advantage of the structure of resilient objects and exploiting semantic information about operations.