论文信息 - On the power of locking

On the power of locking

We study the expressive power of locking primitives, as measured by ther ability to implement different concurrency control principles. We give a necessary and sufficient condition for a concurrency control principle (abstractly, a set of histories) to be implementable by binary semaphores. Also, we characterize exactly those sets of locking primitives that are no more powerful than binary semaphores.

Christos H. Papadimitriou

[1] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.

[2] Eugene W. Stark. Semaphore primitives and starvation-free mutual exclusion , 1982, JACM.

[3] Leslie Lamport. Towards a theory of correctness of multi-user database systems , 1976 .

[4] H. T. Kung,et al. An optimality theory of concurrency control for databases , 1979, SIGMOD '79.

[5] Daniel J. Rosenkrantz,et al. Concurrency control for database systems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[6] A BernsteinPhilip,et al. Concurrency control in a system for distributed databases (SDD-1) , 1980 .

[7] Irving L. Traiger,et al. Granularity of locks in a shared data base , 1975, VLDB '75.

[8] Christos H. Papadimitriou,et al. The serializability of concurrent database updates , 1979, JACM.

[9] C. A. R. Hoare,et al. Monitors: an operating system structuring concept , 1974, CACM.

[10] Mihalis Yannakakis,et al. Locking policies: Safety and freedom from deadlock , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11] Philip A. Bernstein,et al. Concurrency control in a system for distributed databases (SDD-1) , 1980, TODS.