THE PERFORMANCE OF PROTOCOLS BASED ON LOCKS WITH ORDERED SHARING
THE PERFORMANCE OF PROTOCOLS BASED ON LOCKS WITH ORDERED SHARING
复制标题
DOI：
10.1109/69.317708
复制
发表时间：
1994-10-01
影响因子：
8.9
通讯作者：
LANG, AE
中科院分区：
文献类型：
--
作者：
AGRAWAL, D;ELABBADI, A;LANG, AE
越来越多的证据表明，对于各种各样的数据库工作负载和系统配置，基于锁的并发控制优于其他类型的并发控制策略。然而，在存在增加的数据争用的情况下，诸如两阶段锁定的锁定协议执行得很差。在本文中，我们分析了一个家庭的锁定为基础的协议，采用一种新的锁之间的关系称为有序共享。使用集中式数据库仿真模型，我们证明了这些协议表现出相当的性能，传统的基于锁定的协议时，数据争用低，他们表现出上级性能时，数据争用高。此外，我们表明，这些协议的性能提高资源变得更加丰富。这一点特别重要，因为两阶段锁定的性能会因数据争用而降低，也不会因资源争用而降低。因此，引入额外的资源提高了所提出的协议的性能，但它并没有显着的好处两阶段锁定。
There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of two-phase locking degrades as a result of data contention, nor resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.