The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July (1990 vol.1)
pp: 344-356
ABSTRACT
<p>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.</p>
INDEX TERMS
Index Termsresilient mutual exclusion algorithm; computer networks; network failure; processor failure; communication controller failure; communication link failure; computer networks
CITATION
S. Nishio, K.F. Li, E.G. Manning, "A Resilient Mutual Exclusion Algorithm for Computer Networks", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 3, pp. 344-356, July 1990, doi:10.1109/71.80161
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool