The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
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
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion
ACM SIGOPS Operating Systems Review
A tale of two directories: implementing distributed shared objects in Java
JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Developing and Refining an Adaptive Token-Passing Strategy
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Implementing distributed mutual exclusion on multithreaded environments: the alien-threads approach
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
A mutual exclusion algorithm for mobile agents-based applications
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.01 |
In a distributed context, mutual exclusion algorithms can be divided into two familiesaccording to their underlying algorithmic principles: those that are permission-based andthose that are token-based. Within the latter family, a lot of algorithms use a rooted treestructure to move the requests and the unique token. This paper presents a very generalinformation structure (and the associated generic algorithm) for token- and tree-basedmutual exclusion algorithms. This general structure not only covers, as particular cases,several known algorithms, but also allows for the design of new ones that are well suitedfor various topology requirements.