This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Resilient Mutual Exclusion Algorithm for Computer Networks
July 1990 (vol. 1 no. 3)
pp. 344-356

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.

[1] O. S. F. Carvalho, G. Roucairol, G. Ricart, and A. K. Agrawala, "On mutual exclusion in computer networks,"Commun. ACM, vol. 26, no. 2, pp. 146-149, 1983.
[2] E. Chang and R. Roberts, "An improved algorithm for decentralized extrema-finding in circular configurations of processes,"Commun. ACM, vol. 22, no. 5, pp. 281-283, 1979.
[3] E. W. Dijkstra, "Solution of a problem in concurrent programming control,"Commun. ACM, vol. 8, pp. 569-569, Sept. 1965.
[4] E. Dijkstra, "Self-stabilizing systems in spite of distributed control,"Commun. ACM, vol. 17, pp. 643-644, 1974.
[5] H. Garcia-Molina, "Reliability issues for fully replicated distributed databases, "IEEE Comput. Mag., vol. 15, no. 9, pp. 34-42, 1982.
[6] P. Brinch Hansen,Operating System Principles, Englewood Cliffs, NJ: Prentice-Hall, 1973.
[7] D. S. Hirschberg and J. B. Sinclair, "Decentralized extrema-finding in circular configurations of processors,"Commun. ACM, vol. 23, no. 11, pp. 627-628, 1980.
[8] E. Korach, S. Moran, and S. Zaks, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors," inProc. 3rd ACM Symp. Principles Distributed Comput., Vancouver, B.C., Canada, Aug. 1984, pp. 199-207.
[9] L. Lamport, "Time, clocks, and the ordering of events in a distributed system,"Commun. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[10] G. LeLann, "Distributed systems-Toward a formal approach," inProc. IFIP Congress, 1977, pp. 155-160.
[11] G. LeLann, "Algorithms for distributed data sharing systems which use tickets," inProc. 3rd Berkeley Workshop Distributed Data Management Comput. Networks, 1978, pp. 259-272.
[12] M. Maekawa, "A√N algorithm for mutual exclusion in decentralized systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, May 1985.
[13] T. Minoura and G. Wiederhold, "Resilient extended true-copy token scheme for a distributed database system,"IEEE Trans. Software Eng., vol. SE-8, no. 3, pp. 173-189, 1982.
[14] T. Minoura, "Ranking scheme and control token scheme," inProc. 2nd Symp. Reliability Distributed Software Database Syst., 1982, pp. 40-45.
[15] S. Nishio, N. Katoh, T. Minoura, and T. Hasegawa, "A resilient token transfer algorithm for mutual exclusion in a distributed system," (in Japanese)Trans. IECEJ, vol. J67-D, no. 6, pp. 661-668, 1984.
[16] S. Nishio, K. F. Li, and E. G. Manning, "A time-out based resilient token transfer algorithm for mutual exclusion in computer networks," inProc. 9th Int. Conf. Distributed Comput., Newport Beach, CA, 1989, pp. 386-393.
[17] S. Nishio, K. F. Li, and E. G. Manning, "A time-out based resilient token transfer algorithm for mutual exclusion in computer networks," Tech. Rep. ECE88-3, Dep. Elec. Comput. Eng., Univ. of Victoria, Victoria, B.C., Canada, 1988.
[18] G. L. Peterson, "An O(n log n) unidirectional algorithm for the circular extrema problem,"ACM Trans. Programming Languages Syst., vol. 4, pp. 758-762, 1982.
[19] K. Raymond, "A tree based algorithm for distributed mutual exclusion,"ACM Trans. Comput. Syst., vol. 7, pp. 61-77, 1989.
[20] M. Raynal,Algorithms for Mutual Exclusion. North Oxford Academic, 1886. (Translated by D. Beeson).
[21] D. P. Reed and R. K. Kanodia, "Synchronization with eventcounts and sequences,"Commun. ACM, vol. 22, pp. 115-123, Feb. 1979.
[22] G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks,"Commun. ACM, vol. 24, pp. 9-17, 1981.
[23] M. Singhal, "A heuristically-aided algorithm for mutual exclusion in distributed systems,"IEEE Trans. Comput., vol. 38, no. 5, pp. 651-662, 1989.
[24] J. L. A. van de Snepscheut, "Fair mutual exclusion on a graph of processes, distributed computing,"Distributed Comput., vol. 2, pp. 113-115, 1987.
[25] I. Suzuki and T. Kasami, "An optimality theory for mutual exclusion algorithms in computer networks," inProc. 3rd Int. Conf. Distributed Comput Syst., 1982, pp. 365-370.
[26] I. Suzuki and T. Kasami, "A distributed mutual exclusion algorithm,"ACM Trans. Comput. Syst., vol. 3, no. 4, pp. 344-349, 1985.

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 and Distributed Systems, vol. 1, no. 3, pp. 344-356, July 1990, doi:10.1109/71.80161
Usage of this product signifies your acceptance of the Terms of Use.