A simple taxonomy for distributed mutual exclusion algorithms
- 1 April 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 25 (2) , 47-50
- https://doi.org/10.1145/122120.122123
Abstract
This short paper examines the two basic principles from which distributed mutual exclusion algorithms are designed : permission-based and token-based principles. This presentation is done in a pedagogical way and is illustrated by references to existing algorithms.Keywords
This publication has 17 references indexed in Scilit:
- A heuristically-aided algorithm for mutual exclusion in distributed systemsIEEE Transactions on Computers, 1989
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989
- The information structure of distributed mutual exclusion algorithmsACM Transactions on Computer Systems, 1987
- Fair mutual exclusion on a graph of processesDistributed Computing, 1987
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- A simple guide to five normal forms in relational database theoryCommunications of the ACM, 1983
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978