What does the part in bold mean?
Round 2" Process i sends its value of y to all processes, including itself. If, in the set of messages received at this round, there are _> n - f copies of a particular value in V, then i sets vote " - 1; otherwise vote " - O. Also, i sets z equal to the non-null value that occurs most often among the messages received by i at this round, with ties broken arbitrarily; if all messages are null, then z remains undefined.
Distributed Algorithms, lynch
e. with equal greatest frequency). If this happens, one of these values is selected arbitrarily, which could mean at random, or could possibly include any arbitrary deterministic selection method.
New words, one handy idiom, and a 2-minute quiz — delivered to your inbox to keep your streak alive.
A "tie" is when two or more non-null values occur most often (i.e. with equal greatest frequency). If this happens, one of these values is selected arbitrarily, which could mean at random, or could possibly include any arbitrary deterministic selection method.