The Community for Technology Leaders
2015 11th European Dependable Computing Conference (EDCC) (2015)
Paris, France
Sept. 7, 2015 to Sept. 11, 2015
ISBN: 978-1-4673-9288-4
pp: 198-204
The Raft consensus algorithm is a new distributed consensus algorithm that is both easier to understand and more straightforward to implement than the older Paxos algorithm. Its major limitation is its high energy footprint. As it relies on majority consensus voting for deciding when to commit an update, Raft requires five participants to protect against two simultaneous failures. We propose two methods for reducing this huge energy footprint. Our first proposal consists of adjusting Raft quorums in a way that would allow updates to proceed with as few as two servers while requiring a larger quorum for electing a new leader. Our second proposal consists of replacing one or two of the five Raft servers with witnesses, that is, lightweight servers that maintain the same metadata as other servers but hold no data and can therefore run on very low-power hosts. We show that these substitutions have little impact on the cluster availability but very different impacts on the risks of incurring a data loss.
Servers, Nominations and elections, Clustering algorithms, Algorithm design and analysis, Proposals, Fault tolerance, Fault tolerant systems

J. Paris and D. D. Long, "Reducing the Energy Footprint of a Distributed Consensus Algorithm," 2015 11th European Dependable Computing Conference (EDCC), Paris, France, 2016, pp. 198-204.
176 ms
(Ver 3.3 (11022016))