Raft Algorithm
Jump to navigation
Jump to search
A Raft Algorithm is a consensus algorithm.
- Counter-Example(s):
- See: Consensus Algorithm, Consensus (Computer Science).
References
2023
- (Wikipedia, 2023) ⇒ https://en.wikipedia.org/wiki/Raft_(algorithm) Retrieved:2023-2-3.
- Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers some additional features.[1] Raft offers a generic way to distribute a state machine across a cluster of computing systems, ensuring that each node in the cluster agrees upon the same series of state transitions. It has a number of open-source reference implementations, with full-specification implementations in Go, C++, Java, and Scala.[2] It is named after Reliable, Replicated, Redundant, And Fault-Tolerant. [3]
Raft is not a Byzantine fault tolerant algorithm: the nodes trust the elected leader.[1]
- Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers some additional features.[1] Raft offers a generic way to distribute a state machine across a cluster of computing systems, ensuring that each node in the cluster agrees upon the same series of state transitions. It has a number of open-source reference implementations, with full-specification implementations in Go, C++, Java, and Scala.[2] It is named after Reliable, Replicated, Redundant, And Fault-Tolerant. [3]
- ↑ 1.0 1.1 Cite error: Invalid
<ref>tag; no text was provided for refs namedpaper - ↑ Cite error: Invalid
<ref>tag; no text was provided for refs namedwebsite - ↑ Why the "Raft" name?