arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.01997cs.DB
收藏

通过事务调度提高高竞争OLTP性能

Improving High Contention OLTP Performance via Transaction Scheduling

Guna Prasaad, Alvin Cheung, Dan Suciu

摘要:

事务处理的研究在提高多核内存事务系统的性能方面取得了重大进展。然而,重点主要集中在低争用工作负载上。现代事务系统在工作负载上的性能很差,事务访问一些高度竞争的数据项。我们观察到,大多数事务性工作负载,包括那些具有高竞争性的工作负载,可以被划分为无数据冲突事务的集群和一小部分残差。在本文中,我们介绍了一个新的并发控制协议称为冲突,利用上述观察。Strife以批处理的方式执行事务,其中每个批处理被划分为无冲突事务的集群和一小组剩余事务。在没有任何并发控制的情况下并行地执行无冲突集群,随后串行地或在具有并发控制的情况下执行剩余集群。我们提出了一个低开销的算法,一批事务划分成簇,没有跨簇冲突和一个小的残留集群。我们评估冲突对乐观的并发控制协议和两阶段锁定的几个变种,后者是已知的高竞争下比其他并发协议执行得更好,并表明冲突可以提高事务吞吐量高达2倍。我们还进行了深入的微观基准分析,以经验为特征的性能和质量,我们的聚类算法

英文摘要:

Research in transaction processing has made significant progress in improving the performance of multi-core in-memory transactional systems. However, the focus has mainly been on low-contention workloads. Modern transactional systems perform poorly on workloads with transactions accessing a few highly contended data items. We observe that most transactional workloads, including those with high contention, can be divided into clusters of data conflict-free transactions and a small set of residuals. In this paper, we introduce a new concurrency control protocol called Strife that leverages the above observation. Strife executes transactions in batches, where each batch is partitioned into clusters of conflict-free transactions and a small set of residual transactions. The conflict-free clusters are executed in parallel without any concurrency control, followed by executing the residual cluster either serially or with concurrency control. We present a low-overhead algorithm that partitions a batch of transactions into clusters that do not have cross-cluster conflicts and a small residual cluster. We evaluate Strife against the optimistic concurrency control protocol and several variants of two-phase locking, where the latter is known to perform better than other concurrency protocols under high contention, and show that Strife can improve transactional throughput by up to 2x. We also perform an in-depth micro-benchmark analysis to empirically characterize the performance and quality of our clustering algorithm

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑