Basil: Breaking up BFT with ACID (transactions)
Basil: Breaking up BFT with ACID (transactions)
复制标题
DOI：
10.1145/3477132.3483552
复制
发表时间：
2021-09
期刊：
影响因子：
--
通讯作者：
Florian Suri-Payer;Matthew Burke;Zheng Wang-;Yunhao Zhang;Lorenzo Alvisi;Natacha Crooks
中科院分区：
文献类型：
--
作者：
Florian Suri-Payer;Matthew Burke;Zheng Wang-;Yunhao Zhang;Lorenzo Alvisi;Natacha Crooks
本文介绍了Basil，第一个事务性、无领导的拜占庭容错键值存储。Basil利用ACID事务在拜占庭参与者存在的情况下可扩展地实现可信共享日志的抽象。与传统的BFT方法不同，Basil并行执行非冲突操作，并在无故障执行期间在单个往返中提交事务。Basil将传统BFT系统的吞吐量提高了四到五倍，并且仅比非拜占庭复制系统TAPIR慢四倍。Basil的新型恢复机制进一步最大限度地减少了故障的影响：在最坏的情况下，30%的拜占庭客户端的吞吐量下降不到25%。
This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-value store. Basil leverages ACID transactions to scalably implement the abstraction of a trusted shared log in the presence of Byzantine actors. Unlike traditional BFT approaches, Basil executes non-conflicting operations in parallel and commits transactions in a single round-trip during fault-free executions. Basil improves throughput over traditional BFT systems by four to five times, and is only four times slower than TAPIR, a non-Byzantine replicated system. Basil's novel recovery mechanism further minimizes the impact of failures: with 30% Byzantine clients, throughput drops by less than 25% in the worst-case.