Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Introduction to Algorithms
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
ICDCS '99 Workshop on Self-stabilizing Systems
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilization with Global Rooted Synchronizers
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Snap-Stabilizing optimal binary search tree
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Self-stabilising protocols on oriented chains with joins and leaves
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.02 |
We present a space and (asymptotically) time optimal self-stabilizing algorithm for simultaneously activating non-adjacent processes in a rooted tree (Algorithm $\mathcal{SSDST}$). We then give two applications of the proposed algorithm: a time and space optimal solution to the local mutual exclusion problem (Algorithm $\mathcal{LMET}$) and a space and (asymptotically) time optimal distributed algorithm to place the values in min-heap order (Algorithm ${\mathcal{HEAP}}$). All algorithms are self-stabilizing and uniform, and they work under any unfair distributed daemon. In proving the time complexity of the heap construction, we use the notion of pseudo-time. Pseudo-time is similar to logical time introduced by Lamport [12]