A time-out based resilient token transfer algorithm for mutual exclusion in computer networks
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- Reliability issues for fully replicated distributed databasesComputer, 1982
- Resilient Extended True-Copy Token Scheme for a Distributed Database SystemIEEE Transactions on Software Engineering, 1982
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979
- Synchronization with eventcounts and sequencersCommunications of the ACM, 1979
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965