Week 9: quiz

The caption of Figure 9.1 says: "However, at time t = 3, 4, ... this does not necessarily hold."

Design some distributed algorithm A that demonstrates this. When you run algorithm A, the following should happen:

  • At time t = 0, 1, and 2, nodes u and v have the same local state.
  • At time t = 3, 4, ..., nodes u and v never have the same local state.

An informal description of the algorithm is enough.