Snap-stabilizing committee coordination

—In this paper, we propose two snap-stabilizing distributed algorithms for the committee coordination problem. In this problem, any committee consists of a set of processes and committee meetings are synchronized, so that each process participates in at most one committee meeting at any time. Snap-stabilization is a versatile technique allowing to design algorithms that efficiently tolerate transient faults. Indeed, after a finite number of such faults (e.g. memory corruptions, message losses, etc), a snap-stabilizing algorithm immediately operates correctly, without any external intervention. We design snap-stabilizing committee coordination algorithms enriched with some desirable properties related to concurrency, (weak) fairness, and a stronger synchronization mechanism called 2-Phase Discussion Time. From previous papers, we know that (1) in the general case, (weak) fairness cannot be achieved in the committee coordination, (2) however, it becomes feasible provided that each pr...

• Type: Journal
• Year: 2016
• Where: JPDC
• Authors: Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit
• Keywords: JPDC 2016