Brief Announcement: Reaching Approximate Consensus When Everyone May Crash

Lewis Tseng, Qinzi Zhang, Yifan Zhang, Hagit Attiya
2020 International Symposium on Distributed Computing  
Fault-tolerant consensus is of great importance in distributed systems. This paper studies the asynchronous approximate consensus problem in the crash-recovery model with fair-loss links. In our model, up to f nodes may crash forever, while the rest may crash intermittently. Each node is equipped with a limited-size persistent storage that does not lose data when crashed. We present an algorithm that only stores three values in persistent storage - state, phase index, and a counter.
doi:10.4230/lipics.disc.2020.53 dblp:conf/wdag/TsengZZ20 fatcat:naxewatbxvbqtd6xyel47ll7ye