Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic self-stabilization
Information Processing Letters
Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Synchronous vs. Asynchronous Unison
Algorithmica
Lazy and speculative execution in computer systems
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
Proceedings of the 5th European conference on Computer systems
Algorithms and theory of computation handbook
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Hi-index | 0.00 |
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits correct behavior. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits significantly better performances for a subset of executions that are more probable. A speculative protocol is in this sense supposed to be both robust and efficient in practice. We introduce the notion of speculative stabilization which we illustrate through the mutual exclusion problem. We then present a novel speculatively stabilizing mutual exclusion protocol. Our protocol is self-stabilizing for any asynchronous execution. We prove that its stabilization time for synchronous executions is diam(g)/2 steps (where diam(g) denotes the diameter of the system). This complexity result is of independent interest. The celebrated mutual exclusion protocol of Dijkstra stabilizes in n steps (where n is the number of processes) in synchronous executions and the question whether the stabilization time could be strictly smaller than the diameter has been open since then (almost 40 years). We show that this is indeed possible for any underlying topology. We also provide a lower bound proof that shows that our new stabilization time of diam(g)/2 steps is optimal for synchronous executions, even if asynchronous stabilization is not required.