Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
复制标题
具有任意事务数据访问模式的基于锁的并发控制的分析建模
DOI：
10.1145/1712605.1712619
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
P. Romano
中科院分区：
文献类型：
--
作者：
P. D. Sanzo;R. Palmieri;B. Ciciani;F. Quaglia;P. Romano
目前，双相锁（2PL）并发控制算法在事务性系统（如数据库系统和事务性内存）的构建中仍然发挥着核心作用。因此，任何允许对基于2PL的系统的性能进行准确分析和预测的技术都具有广泛的兴趣和适用性。在本文中，我们提出了一个精确的2PL并发控制的分析模型，它克服了先前存在的分析结果的几个局限性。特别是，通过考虑依赖于事务执行阶段的访问分布，我们的模型捕获了实际数据访问模式的相关特征。此外，我们的模型在严重争用场景中提供了更准确的性能预测，在这种场景中，由于锁请求冲突而排队的事务数量预计不是最小的。我们的模型的准确性已经通过基于合成数据访问模式和来自TPC-C基准测试的模式的仿真结果进行了验证。
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memories). Hence, any technique allowing accurate analysis and prediction of the performance of 2PL based systems can be of wide interest and applicability. In this article we present an accurate analytical model of 2PL concurrency control, which overcomes several limitations of preexisting analytical results. In particular our model captures relevant features of realistic data access patterns, by taking into account access distributions that depend on transactions' execution phases. Also, our model provides significantly more accurate performance predictions in heavy contention scenarios, where the number of transactions enqueued due to conflicting lock requests is expected to be non-minimal. The accuracy of our model has been verified against simulation results based on both synthetic data access patterns and patterns derived from the TPC-C benchmark.