Computer Science
Brief announcement: Reaching approximate consensus when everyone may crash
Document Type
Conference Paper
Abstract
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.
Publication Title
Leibniz International Proceedings in Informatics, LIPIcs
Publication Date
2020
Volume
179
ISSN
1868-8969
ISBN
9783959771689
DOI
10.4230/LIPIcs.DISC.2020.53
Keywords
approximate consensus, crash-recovery, fair-loss channel
Repository Citation
Tseng, Lewis; Zhang, Qinzi; and Zhang, Yifan, "Brief announcement: Reaching approximate consensus when everyone may crash" (2020). Computer Science. 120.
https://commons.clarku.edu/faculty_computer_sciences/120
APA Citation
Tseng, L., Zhang, Q., & Zhang, Y. (2020). Brief Announcement: Reaching Approximate Consensus When Everyone May Crash. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
