发表机构
Tsinghua University; Beijing Academy of Blockchain and Edge Computing（清华大学; 北京区块链与边缘计算研究院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文提出确定性并发控制协议Lantern，通过DAG上的反向传播机制识别可提交事务，集成至ChainMaker后在YCSB和SmallBank基准上较Aria获最高4.2倍吞吐量加速，提升ChainMaker执行层至少2.2倍吞吐量。
AI 中文摘要
现有的并发控制协议要么引入不确定性，导致主节点与副本节点之间存在串行执行-重放依赖，要么依赖于不切实际的事务读写集先验知识。本文提出Lantern，一种专为无先验知识的高性能事务处理系统设计的确定性并发控制协议。Lantern的核心思路是，利用允许覆盖的策略，可按升序安全提交本地依赖图中所有出度为0的事务顶点。我们还引入了一种新颖的反向传播（Back-Propagation）机制，该机制会迭代地将依赖状态从汇点顶点传播到源顶点，以识别更多可提交的事务。此外，针对读写修改密集型场景，我们提出了无冲突批量选择（Conflict-Free Batch Selection, CFBS）方法。我们将Lantern集成到开源区块链平台ChainMaker中，在YCSB和SmallBank基准测试上进行的大量评估表明，Lantern相比Aria实现了最高达4.2倍的吞吐量加速，且使ChainMaker执行层的吞吐量至少提升了2.2倍。
英文摘要
Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for high-performance transaction processing systems operating without prior knowledge. The key insight of Lantern is that all zero-out-degree transaction vertices in the local dependency graph can be safely committed in ascending order using an overwrite-permissive strategy. We further introduce a novel Back-Propagation mechanism that iteratively propagates dependency states from sink to source vertices to identify additional committable transactions. We also propose Conflict-Free Batch Selection (CFBS) for read-modify-write intensive scenarios. We integrate Lantern into the open-source blockchain platform ChainMaker. Extensive evaluations on YCSB and SmallBank benchmarks demonstrate that Lantern achieves up to a 4.2x throughput speedup over Aria and improves the throughput of ChainMaker's execution layer by at least 2.2x.
