首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Distributed optimistic concurrency control methods for high-performance transaction processing
【24h】

Distributed optimistic concurrency control methods for high-performance transaction processing

机译:用于高性能事务处理的分布式乐观并发控制方法

获取原文
获取原文并翻译 | 示例
           

摘要

There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is especially a concern in shared-nothing or data-partitioned systems due to the extra latencies for internode communication and a reliable commit protocol. The optimistic CC (OCC) is a possible solution, but currently proposed methods have the disadvantage of repeated transaction restarts. We present a distributed OCC method followed by locking, such that locking is an integral part of distributed validation and two-phase commit. This method ensures at most one re-execution, if the validation for the optimistic phase fails. Deadlocks, which are possible with 2PL, are prevented by preclaiming locks for the second execution phase. This is done in the same order at all nodes. We outline implementation details and compare the performance of the new OCC method with distributed 2PL through a detailed simulation that incorporates queueing effects at the devices of the computer systems, buffer management, concurrency control, and commit processing. It is shown that for higher data contention levels, the hybrid OCC method allows a much higher maximum transaction throughput than distributed 2PL in systems with high processing capacities. In addition to the comparison of CC methods, the simulation study is used to study the effect of varying the number of computer systems with a fixed total processing capacity and the effect of locality of access in each case. We also describe several interesting variants of the proposed OCC method, including methods for handling access variance, i.e., when rerunning a transaction results in accesses to a different set of objects.
机译:交易处理系统中对更复杂的交易和更高的吞吐量的需求不断增长,这导致更高的交易并发度,并因此导致更高的数据争用。因此,常规的两阶段锁定(2PL)并发控制(CC)方法可能会将系统吞吐量限制在与可用处理能力不一致的水平。在无共享或数据分区的系统中,由于节点间通信的额外延迟和可靠的提交协议,这尤其令人担忧。乐观CC(OCC)是一种可能的解决方案,但是当前提出的方法具有重复事务重新启动的缺点。我们提出了一种分布式OCC方法,其后是锁定,因此锁定是分布式验证和两阶段提交的组成部分。如果乐观阶段的验证失败,则此方法可确保最多执行一次重新执行。通过声明第二个执行阶段的锁,可以防止2PL可能发生的死锁。在所有节点上以相同顺序完成此操作。我们概述了实现细节,并通过详细的模拟比较了新的OCC方法与分布式2PL的性能,该模拟结合了计算机系统设备的排队效果,缓冲区管理,并发控制和提交处理。结果表明,对于较高的数据争用级别,在具有高处理能力的系统中,混合OCC方法比分布式2PL具有更高的最大事务吞吐量。除了比较CC方法外,还使用模拟研究来研究改变具有固定总处理能力的计算机系统数量的影响以及每种情况下访问位置的影响。我们还描述了所提出的OCC方法的几种有趣的变体,包括用于处理访问差异的方法,即当重新运行事务导致对不同对象集的访问时。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号