Self-stabilizing byzantine asynchronous unison - Sorbonne Université Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2012

Self-stabilizing byzantine asynchronous unison


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.

Dates and versions

hal-00934022 , version 1 (21-01-2014)



Swan Dubois, Maria Potop-Butucaru, Mikhail Nesterenko, Sébastien Tixeuil. Self-stabilizing byzantine asynchronous unison. Journal of Parallel and Distributed Computing, 2012, 72 (7), pp.917-923. ⟨10.1016/j.jpdc.2012.04.001⟩. ⟨hal-00934022⟩
249 View
0 Download



Gmail Facebook X LinkedIn More