Muzzaf

3 ms·

1.
by Muzzaf 12y ago
The day when the entire arXiv is re-typeset in Comic Sans cannot come soon enough. Rebels like Peyton-Jones are truly fighting the good fight.
2.
by Muzzaf 12y ago
http://www.cs.virginia.edu/~robins/YouAndYourResearch.html > John Tukey almost always dressed very casually. He would go into an important office and it would take a long time before the other fellow realized that t
3.
by Muzzaf 12y ago
At most one side can elect a new leader, since there are an odd number of nodes.
4.
by Muzzaf 12y ago
Not sure I understand. A node in each split cluster would need at least 4 votes to be elected leader. Hence no node can be elected leader since all split clusters have strictly fewer than 4 nodes. Theorem. With 2n + 1 nodes, there can not b
5.
by Muzzaf 12y ago
See section 10 of the Raft paper. > VR uses a leaderbased approach with many similarities to Raft. > However, Raft has less mechanism that VR or ZooKeeper because it minimizes the functionality in non-leaders. For example, log entries
6.
by Muzzaf 12y ago
> What happens if (for instance) a 4 node cluster splits into 2 node clusters (I.E. a network fault between two data centers)- does each cluster choose a leader? A Raft cluster must have an odd number of nodes. > how are is "majo
7.
by Muzzaf 12y ago
That is correct. The solution to this is given in section 5.4.1 (election restriction), section 5.4.2 (Committing entries from previous terms) and section 8 (Client interaction) of the Raft paper. Roughly, a newly elected leader will have a