返回Google圖書搜尋

Tradeoffs Between Static and Dynamic Lock Name Space Partitioning

Thomas J. Watson IBM Research CenterB. R. IyerC. M. Krishna

出版	IBM Thomas J. Watson Research Division, 1988
URL	http://books.google.com.hk/books?id=gNjIGwAACAAJ&hl=&source=gbs_api

註釋Abstract: "Computer vendors are turning to loosely coupled processor architectures to help meet ever-increasing demands for on-line transaction processing (OLTP) capacity. Under data sharing loosely coupled processors share files or databases on disks. Concurrency control is generally effected by means of locks: the lock name space is partitioned into classes whose ownership is assigned to one of the processors. The owner of a class receives and resolves lock requests for all entities within that class. In static partitioning schemes, the ownership of classes is fixed. By contrast, in dynamic partitioning, ownership varies with time: a processor is granted ownership of class C if (a) it is running a transaction that requests an entity within that class, and (b) no other processor currently owns class C. When the owning processor has no transactions which require locks on class C, it releases ownership