Consider the following algorithmto coordinate attack by two processes. There are
ID: 3616714 • Letter: C
Question
Consider the following algorithmto coordinate attack by two processes.
There are 4 rounds ofcommunication, with each process sending a message
in each round. A message carriesa detailed description of the history of the
execution until the currentround, as experienced by the sender. If process x
knows the two initial values andalso that the other process yhas learnt
both the initial values,then x decideson the minimum of the two values,
otherwise on 0.
Describe such a strategy of theoblivious adversary, as an assignment of initial values
and a failure pattern, for which thisalgorithm is not correct.
Explanation / Answer
Need 4 rounds of communication
When X send Message then next round Y send message
Put limit of time to execute each action