A distributed k-mutual exclusion algorithm using k-coterie
- 25 February 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 49 (4) , 213-218
- https://doi.org/10.1016/0020-0190(94)90014-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Availability of k-coterieIEEE Transactions on Computers, 1993
- Another distributed algorithm for multiple entries to a critical sectionInformation Processing Letters, 1992
- A simple taxonomy for distributed mutual exclusion algorithmsACM SIGOPS Operating Systems Review, 1991
- A distributed algorithm for multiple entries to a critical sectionInformation Processing Letters, 1989
- The information structure of distributed mutual exclusion algorithmsACM Transactions on Computer Systems, 1987
- A distributed mutual exclusion algorithmACM Transactions on Computer Systems, 1985
- How to assign votes in a distributed systemJournal of the ACM, 1985
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978