Algorithms for mutual exclusion
Algorithms for mutual exclusion
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 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 O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Synchronization with eventcounts and sequencers
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Operating system principles
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Communications of the ACM
A new fault tolerant distributed mutual exclusion algorithm
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion
ACM SIGOPS Operating Systems Review
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
IEEE Transactions on Parallel and Distributed Systems
A dual-token-based fault tolerant mutual exclusion algorithm for MANETs
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Fault tolerant and robust mutual exclusion protocol for synchronous distributed systems
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 0.00 |
The authors present an extension to the work of I. Suzuki and T. Kasami (see Proc. 3rd Int. Conf. Distributed Compact Syst., p.365-70 (1982)), where a mutual exclusion algorithm uses a message called a token to transfer the privilege of entering a critical region among the participating sites. The proposed algorithm checks whether the token is lost during network failure, and regenerates it if necessary. The mutual exclusion requirement is satisfied by guaranteeing regeneration of only one token in the network. Failures in a computer network are classified into three types: processor failure, communication controller failure, and communication link failure. To detect failures, a time-out mechanism based on message delay is used. The execution of the algorithm is described for each type of failure; each site follows a rather simple execution procedure. Each site is not required to observe the failure of other sites or communication links.