BASIC ALGORITHM Sample Clauses

BASIC ALGORITHM. In BasicMCF, we assume that every proposer and co- ordinator a knows to which group it belongs. This infor- mation is stored in the variable group[a]. Proposers keep no other information. A coordinator c has two other xxxx- xxxxx: crnd [c] The current round of c, initially 0. cval [c] The s-map that c is proposing in round crnd [c], if already defined, or the special value none, other- wise. The value is defined and informed by the co- ordinator who started the round or left to be defined once a proposal is received from some proposer. Ini- tially, it equals none. An acceptor a keeps three variables: rnd [a] The current round of a; initially 0. vrnd [a] The round at which a has accepted its latest value; initially 0. vval [a] The v-map a has accepted at vrnd [a] if it has ac- cepted something at vrnd [a], or special value none otherwise; initially none. Each learner l keeps only the v-map it has learned so far. learned [l ] The v-map currently learned by l ; initially ⊥. We assume that round numbers are partitioned among the possible coordinators in the protocol, for example, by including the coordinator’s unique identifier as part of the round number. Moreover, every round is associated to

BASIC ALGORITHM. In BasicMCF, we assume that every proposer and co- ordinator a knows to which group it belongs. This infor- mation is stored in the variable group[a]. Proposers keep no other information. A coordinator c has two other xxxx- xxxxx: crnd [c] The current round of c, initially 0. cval [c] The s-map that c is proposing in round crnd [c], if already defined, or the special value none, other- wise. The value is defined and informed by the co- ordinator who started the round or left to be defined once a proposal is received from some proposer. Ini- tially, it equals none. An acceptor a keeps three variables: rnd [a] The current round of a; initially 0. vrnd [a] The round at which a has accepted its latest value; initially 0. vval [a] The v-map a has accepted at vrnd [a] if it has ac- cepted something at vrnd [a], or special value none otherwise; initially none. Each learner l keeps only the v-map it has learned so far.