Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Adaptable recovery using dynamic quorum assignments
Proceedings of the sixteenth international conference on Very large databases
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
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
Distributed Operating Systems and Algorithms
Distributed Operating Systems and Algorithms
Finite-state self-stabilizing protocols in message-passing systems
ICDCS '99 Workshop on Self-stabilizing Systems
Lock-based self-stabilizing distributed mutual exclusion algorithms
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Designing self-stabilizing algorithms for practical distributed systems
Designing self-stabilizing algorithms for practical distributed systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root of the number of processes in the system. The algorithm tolerates message loss. The algorithm places few assumptions on timeouts needed for its implementation. All this allows for a ready implementation of the algorithm on practical distributed architectures.