Let us consider the binary consensus algorithm described in Fig. 19.3 extended with the messages DEC(r, v), introduced in Section 19.3.4, which ensure that all correct processes decide and stop. • Is...

Let us consider the binary consensus algorithm described in Fig. 19.3 extended with the messages DEC(r, v), introduced in Section 19.3.4, which ensure that all correct processes decide

and stop.

• Is it possible for a message DEC(r, v) to carry only the value v?

• Is the algorithm still correct if, to expedite decision, the following background task is

added to the algorithm:

background task

if (DEC(v) received from (t + 1) different processes)

then broadcast DEC(v); return(v)

end if.

Solution in [304].