Quantcast

Self-stabilizing silent disjunction in an anonymous network ☆

Research paper by Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore

Indexed on: 22 Mar '17Published on: 23 Dec '16Published in: Theoretical Computer Science



Abstract

In this paper, we give a distributed silent self-stabilizing algorithm, DISJ, for the disjunction problem in a connected network. In this problem, each process x   has an input bit x.inx.in, assigned by the application layer, and each process must compute the disjunction of the input bits of all processes. DISJ is uniform, and works in an anonymous network under the distributed unfair daemon. The stabilization time of DISJ is O(n)O(n) rounds, where n   is the size of the network, and the memory requirement per process is O(log⁡D+Δ)O(log⁡D+Δ) where DD and Δ are, respectively, the diameter, and the maximum degree of the network.

Figure 10.1016/j.tcs.2016.12.012.0.gif
Figure 10.1016/j.tcs.2016.12.012.1.gif
Figure 10.1016/j.tcs.2016.12.012.2.gif
Figure 10.1016/j.tcs.2016.12.012.3.jpg
Figure 10.1016/j.tcs.2016.12.012.4.jpg
Figure 10.1016/j.tcs.2016.12.012.5.jpg
Figure 10.1016/j.tcs.2016.12.012.6.jpg