Algorithms for mutual exclusion
Algorithms for mutual exclusion
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms
IEEE Transactions on Parallel and Distributed Systems
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
CACHET: an adaptive cache coherence protocol for distributed shared-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A new token passing distributed mutual exclusion algorithm
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Abstract: Token rotation algorithms play an important role in distributed computing, to support such activities as mutual exclusion, round-robin scheduling, group membership and group communication protocols. Ring-based protocols maximize throughput in busy systems, but can incur a linear, in the number of processors, delay when a processor needs to obtain a token to perform an operation. This paper synthesizes these two algorithmic techniques thereby improving performance (responsiveness) of logical ring protocols. The parameterized technique preserves the safety properties of ring protocols and maintains high throughput in busy systems, while reducing the delay in lightly loaded systems from a linear to the logarithmic function in the number of processors. The algorithmic development is done using term rewriting systems where our parameterized protocol is developed in a series of safety-preserving refinements of a basic specification.