Using Logical Rings to Solve the Distributed Mutual Exclusion Problem with Fault Tolerance Issues

  • Authors:

  • Kia Makki;John Dell;Niki Pissinou;W. Melody Moh;Xiaohua Jia

  • Affiliations:

  • Center for Telecommunication Studies, University of Louisiana, Lafayette, Lafayette, Louisiana 70504 kia@louisiana.edu;Center for Telecommunication Studies, University of Louisiana, Lafayette, Lafayette, Louisiana 70504;Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, Louisiana 70504 pissinou@cacs.louisiana.edu;Dept. of Math. and Computer Science, San Jose State University, San Jose, CA 95192-0103 moh@cs.sjsu.edu;Dept. of Computer Science, City University of Hong Kong, Hong Kong, China csjia@cityu.edu.hk

  • Venue:
  • The Journal of Supercomputing - Special issue on embedded fault-tolerance systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we investigate distributed mutual exclusion algorithms and delineate the features of a new distributed mutual exclusion algorithm. The basis of the algorithm is the logical ring structure employed in token-based mutual exclusion algorithms. Specifically, there exists dynamic properties of the logical ring that, given certain restrictions regarding message traffic flow, passively give useful information about the location of the token. Effectively, the algorithm demonstrates a type of “intelligent routing” that identifies useful shortcuts in the routing of the token. The result is a reduction in the total number of messages exchanged prior to the execution of the critical section as compared to the algorithm proposed by Fu and Tzeng [3]. Furthermore, the algorithm allows for an increased degree of fairness in a lightly loaded system than that allowed by Fu and Tzeng's algorithm. The paper also addresses failure recovery issues.