Revision as of 09:08, 16 April 2020 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,154 edits →State Machine Safety: fmt Tag: 2017 wikitext editor ← Previous edit		Revision as of 09:08, 16 April 2020 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,154 edits →Basics: fmt Tag: 2017 wikitext editor Next edit →
Line 11: The consensus problem is decomposed in Raft into two relatively independent subproblems listed down below. ==== Leader ~~Election~~election ==== When the existing leader fails or when you start your algorithm, a new leader needs to be elected. Line 20: Raft uses a randomized election timeout to ensure that split vote problems are resolved quickly. This should reduce the chance of a split vote because servers won't become candidates at the same time: a single server will time out, win the election, then become leader and send heartbeat messages to other servers before any of the followers can become candidates.<ref name="paper" /> ==== Log ~~Replication~~replication ==== The leader is responsible for the log replication. It accepts client requests. Each client request consists of a command to be executed by the replicated state machines in the cluster. After being appended to the leader's log as a new entry, each of the requests is forwarded to the followers as AppendEntries messages. In case of unavailability of the followers, the leader retries AppendEntries messages indefinitely, until the log entry is eventually stored by all of the followers.

Raft (algorithm): Difference between revisions