Self-stabilizing silent disjunction in an anonymous network

Abstract

Given a fixed input bit to each process of a connected network of processes, the disjunction problem is for each process to compute an output bit , whose value is 0 if all input bits in the network are 0, and 1 if there is at least one input bit in the network which is 1. A uniform asynchronous distributed algorithm DISJ is given for the disjunction problem in an anonymous network. DISJ is self-stabilizing, meaning that the correct output is computed from an arbitrary initial configuration, and is silent, meaning that every computation of DISJ is finite. The time complexity of DISJ is O (n) rounds, where n is the size of the network. DISJ works under the unfair daemon. © Springer-Verlag 2013.