Self-stabilizing local mutual exclusion and daemon refinement
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1919504
- A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
- Daemon Conversions in Distributed Self-stabilizing Algorithms
- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
- Randomized uniform self-stabilizing mutual exclusion
Cited in
(14)- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Optimal 1-fair alternators
- An asynchronous message-passing distributed algorithm for the generalized local critical section problem
- Self-stabilizing distributed algorithm for local mutual inclusion
- Request-based token passing for self-stabilizing mutual exclusion
- An optimal self-stabilizing strarvation-free alternator
- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- Fairness in systems based on multiparty interactions
- scientific article; zbMATH DE number 2061542 (Why is no real title available?)
- scientific article; zbMATH DE number 1919504 (Why is no real title available?)
- Daemon Conversions in Distributed Self-stabilizing Algorithms
- Alternators on uniform rings of odd size
This page was built for publication: Self-stabilizing local mutual exclusion and daemon refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766877)
