Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault tolerance in wireless sensor networks through self-stabilisation
International Journal of Communication Networks and Distributed Systems
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
Information Processing Letters
Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Wait-free dining under eventual weak exclusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms and theory of computation handbook
A new technique for proving self-stabilizing under the distributed scheduler
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
Efficient transformation of distance-2 self-stabilizing algorithms
Journal of Parallel and Distributed Computing
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Information Processing Letters
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
Information Processing Letters
Hi-index | 0.00 |
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 selfstabilizing 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.