Uniform actions in asynchronous distributed systems . ACM, Aug. 1994. We strengthen these bounds to those shown in Table 1. Malki et al. Whenever any node in a particular group takes an action from some set A, all other nodes in the group must eventually take that same action, even if the rst node subsequently fails.
Nodes can leave and join the group during the computation.
Malki, D., Birman, K., Ricciardi, A., and Schiper, A. Uniform actions in asynchronous distributed systems . Uniform Actions in Asynchronous Distributed Systems . Cornell University Department of Computer Science Technical Report TR 94-1447, Sept. 1994. Uniform Actions in Asynchronous Distributed Systems . For many applications consistency, it should also be something that is indistinguishable, certainly to clients of any service S is implementing, from q having crashed.