Back to Search
Start Over
Self-stabilizing byzantine asynchronous unison
- Source :
-
Journal of Parallel & Distributed Computing . Jul2012, Vol. 72 Issue 7, p917-923. 7p. - Publication Year :
- 2012
-
Abstract
- Abstract: We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 07437315
- Volume :
- 72
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- Journal of Parallel & Distributed Computing
- Publication Type :
- Academic Journal
- Accession number :
- 75346894
- Full Text :
- https://doi.org/10.1016/j.jpdc.2012.04.001