Conflict Managers for Self-stabilization without Fairness Assumption - Archive ouverte HAL Access content directly
Conference Papers Year :

Conflict Managers for Self-stabilization without Fairness Assumption

Sébastien Tixeuil


In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two nodes that are in conflict cannot enter their critical section simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of self-stabilizing algorithms that operate in an essentially sequential model, into self-stabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer requires initial symmetry breaking but preserves the original algorithm guarantees.

Dates and versions

hal-01336216 , version 1 (22-06-2016)



Maria Gradinariu, Sébastien Tixeuil. Conflict Managers for Self-stabilization without Fairness Assumption. 27th International Conference on Distributed Computing Systems (ICDCS'07), Jun 2007, Toronto, Canada. pp.46, ⟨10.1109/ICDCS.2007.95⟩. ⟨hal-01336216⟩
90 View
0 Download



Gmail Facebook Twitter LinkedIn More