JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Kim, Yoon;
  PDF(new window)
 Abstract
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In this paper, we propose the new algorithm which is modified from Garg's algorithm[1] thus works properly in a fault-tolerant system. In our algorithm, after electing the token generator, the elected process generates a new token based on the information of the myreqlist which is kept by every process and the reqdone which is received during election. Consequently, proposed algorithm tolerates any number of process failures and also does even when only one process is alive.
 Keywords
Mutual Exclusion;Critical Section;Fault-Tolerant;Fault Detection;timeout;safety;liveness;fairness;
 Language
English
 Cited by
 References
1.
Vijay K. Garg, Elements of Distributed Computing, A John Wiley & Sons Inc., Publication, New York, 2002

2.
D. Agrawal and A. El Abbadi, An efficient solution to the distributed mutual exclusion problem, in Proc. 8th ACM Symposium on Principles of Distributed Computing, pp. 193-200, 1989

3.
G.Ricart and A.K.Agrawala, An optimal algorithm for Mutual Exclusion in Computer Networks, Commu nications of the ACM, 1981

4.
M. Singhal, A dynamic information structure for mutual exclusion algorithm for distributed systems, IEEE Transactions on Parallel Distributed Systems, 3(1):121- 125, 1992 crossref(new window)

5.
M. Maekawa, A Square Root N Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems(TOCS), 324):145-159, May 1985

6.
I. Suzuki and T. Kasami,A distributed mutual exclusion algorithm, ACM Transactions on Computer Systems (TOCS), 3(4):344-349, 1985 crossref(new window)

7.
M. Singhal, A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems, IEEE Transactions on Computers, vol. 38, no. 5, pp. 651-662, May 1989 crossref(new window)

8.
Quazi Ehsanul Kabir Mamun and Hidenori Nakazato, A New Token Based Protocol for Group Mutual Exclusion in Distributed Systems, IEEE Proceedings of the fifth International Symposium on Parallel and Distributed Computing, 2006

9.
K. Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems (TOCS), 7(1):61-77, 1989 crossref(new window)

10.
J. Sopena, L Arantes, M Bertier and P Sens. A Fault- Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree. In EuroPar 2005, Lisboa, Portugal, September 2005. LNCS, 2005.

11.
S. Mishra and P.K. Srimani Fault-tolerant mutual exclusion algorithms. Journal of Systems Software, 11(2):111-129, February 1990. crossref(new window)

12.
M. Singhal, A heuristically-aided algorithm for mutual exclusion in distributed systems, IEEE Transactions on Computers, vol. 38, No.5, May 1989, pp. 651-662. crossref(new window)

13.
Chang, M. Singhal, and M. Liu, A fault tolerant algorithm for distributed mutual exclusion, in Proc. of 9th IEEE Syrup. On Reliable Dist. Systems, 1990 pp. 146-154.