Open access
Author
Date
2023-08Type
- Master Thesis
ETH Bibliography
yes
Altmetrics
Abstract
Byzantine fault tolerance is a well-studied strategy for increasing systems’ resilience to attacks but there is also renewed interest in it due to its use in blockchains. Due to its high demands on both computational resources and network, it is a target of a number of optimizations on CPUs as well as a topic for hardware acceleration. This thesis paves the road towards offloading of the Practical Byzantine fault tolerance (PBFT) protocol to FPGAs by presenting a high-performance modular PBFT consensus implementation, which can be used as a platform for future hardware accelerator experiments. We show that compared to moduBFT, a previous implementation exploring the potential for future hardware offloading, we reach multiple times the throughput without an increase in latency. Our modular approach allows for measuring the performance of different parts of the implementation as well as offloading different parts of the protocol. Moreover, unlike moduBFT, our choice of C as im- plementation language brings explicit memory management, which we expect to aid in the use of hardware accelerators. We measure the performance under different scenarios, analyze bottlenecks and discuss different offloading strategies and how they can be incorporated into our implementation. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000628543Publication status
publishedPublisher
ETH ZurichSubject
Byzantine fault tolerance; Hardware offloadOrganisational unit
03506 - Alonso, Gustavo / Alonso, Gustavo
Related publications and datasets
Is supplemented by: https://doi.org/10.3929/ethz-b-000628542
More
Show all metadata
ETH Bibliography
yes
Altmetrics