Paper Info
Title
Self-stabilizing Silent Disjunction in an Anonymous Network.
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.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) rounds, where n is the size of the network, and the memory requirement per process is O(logD+) where D and are, respectively, the diameter, and the maximum degree of the network.
Year
DOI
Venue
2013
10.1016/j.tcs.2016.12.012
Theor. Comput. Sci.
Keywords
Field
DocType
Anonymous network,Disjunction,Self-stabilization,Silence,Unfair daemon
Asynchronous communication,Computer science,Computer network,Theoretical computer science,Distributed algorithm,Time complexity,Daemon,Computation
Conference
Volume
ISSN
Citations 
665
0304-3975
2
PageRank 
References 
Authors
0.38
22
3
Name
Order
Citations
PageRank
Ajoy Kumar Datta131740.76
Stéphane Devismes219225.74
Lawrence L. Larmore3859109.15