Dynamic FTSS in asynchronous systems: The case of unison - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2011

Dynamic FTSS in asynchronous systems: The case of unison

Abstract

Distributed fault-tolerance can mask the effect of a limited number of permanent faults, while self-stabilization provides forward recovery after an arbitrary number of transient faults hit the system. FTSS (Fault-Tolerant Self-Stabilizing) protocols combine the best of both worlds since they tolerate simultaneously transient and (permanent) crash faults. To date, deterministic FTSS solutions either consider static (i.e. fixed point) tasks, or assume synchronous scheduling of the system components.In this paper, we present the first study of deterministic FTSS solutions for dynamic tasks in asynchronous systems, considering the unison problem as a benchmark. Unison can be seen as a local clock synchronization problem as neighbors must maintain digital clocks at most one time unit away from each other, and increment their own clock value infinitely often. We present several impossibility results for this difficult problem and propose an FTSS solution (when the problem is solvable) for the state model that exhibits optimal fault-containment.

Dates and versions

inria-00627763 , version 1 (29-09-2011)

Identifiers

Cite

Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil. Dynamic FTSS in asynchronous systems: The case of unison. Theoretical Computer Science, 2011, 412 (29), pp.3418-3439. ⟨10.1016/j.tcs.2011.02.012⟩. ⟨inria-00627763⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More