O$|$R$|$P$|$E —— 一种数据语义驱动的并发控制
O$|$R$|$P$|$E -- A Data Semantics Driven Concurrency Control
AI总结:
提出数据语义驱动的 \PeFS 多机制并发控制,按 O/R/P/E 数据类别选择策略并运行时自适应,在高负载下显著降低响应时间并提升并发度。
摘要:
本文提出一种不遵循“一种并发控制机制满足所有需求”策略的并发控制机制。借助所提出的机制,一个事务可在多种并发控制机制下运行,并根据所访问的数据选择合适的机制。为此,数据依据其访问类型和用途(语义)被划分为四个类别。类别 $O$(乐观类)实现首个提交者获胜策略,类别 $R$(协调类)实现前 n 个提交者获胜策略,类别 $P$(悲观类)实现首个读取者获胜策略,类别 $E$(托管类)实现前 n 个读取者获胜策略。相应地,该模型被称为 \PeFS。所选并发控制机制可在运行时根据当前负载或已知使用配置文件自动调整。这种运行时调整使 \Pe 即使在条件变化时也能平衡提交率和响应时间。在沉重事务负载(4000 个并发事务)下,\Pe 在响应时间方面比快照隔离并发控制优约 4.5 倍。因此,并发程度提高至 3.2 倍。
英文摘要:
This paper presents a concurrency control mechanism that does not follow a 'one concurrency control mechanism fits all needs' strategy. With the presented mechanism a transaction runs under several concurrency control mechanisms and the appropriate one is chosen based on the accessed data. For this purpose, the data is divided into four classes based on its access type and usage (semantics). Class $O$ (the optimistic class) implements a first-committer-wins strategy, class $R$ (the reconciliation class) implements a first-n-committers-win strategy, class $P$ (the pessimistic class) implements a first-reader-wins strategy, and class $E$ (the escrow class) implements a first-n-readers-win strategy. Accordingly, the model is called \PeFS. The selected concurrency control mechanism may be automatically adapted at run-time according to the current load or a known usage profile. This run-time adaptation allows \Pe to balance the commit rate and the response time even under changing conditions. \Pe outperforms the Snapshot Isolation concurrency control in terms of response time by a factor of approximately 4.5 under heavy transactional load (4000 concurrent transactions). As consequence, the degree of concurrency is 3.2 times higher.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。