Basil: Breaking up BFT with ACID (transactions)

Florian Suri-Payer; Matthew Burke; Zheng Wang; Yunhao Zhang; Lorenzo Alvisi; Natacha Crooks

doi:10.1145/3477132.3483552

Basil: Breaking up BFT with ACID (transactions)

Distributed, Parallel, and Cluster Computing 2021-10-06 v2 Cryptography and Security Databases

Authors: Florian Suri-Payer , Matthew Burke , Zheng Wang , Yunhao Zhang , Lorenzo Alvisi , Natacha Crooks

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

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.

Keywords

byzantine fault tolerance

Cite

@article{arxiv.2109.12443,
  title  = {Basil: Breaking up BFT with ACID (transactions)},
  author = {Florian Suri-Payer and Matthew Burke and Zheng Wang and Yunhao Zhang and Lorenzo Alvisi and Natacha Crooks},
  journal= {arXiv preprint arXiv:2109.12443},
  year   = {2021}
}

Comments

24 pages. 7 Figures. To be published at SOSP'21

Basil: Breaking up BFT with ACID (transactions)

Abstract

Keywords

Cite

Comments

Related papers