Search papers, labs, and topics across Lattice.
This paper introduces Lantern, a deterministic concurrency control protocol designed for high-performance transaction processing systems that operate without prior knowledge of transaction read-write sets. By leveraging a novel Back-Propagation mechanism to identify committable transactions and an overwrite-permissive strategy for zero-out-degree transaction vertices, Lantern significantly enhances throughput. Evaluations reveal that Lantern achieves up to a 4.2x speedup over existing protocols and improves the throughput of the ChainMaker blockchain platform by at least 2.2x.
Lantern's innovative approach allows for a dramatic throughput increase in transaction processing without the need for prior knowledge, challenging conventional concurrency control limitations.
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.
