A Randomized Approach to Bound Jayanti's Mutual Exclusion Algorithm

Abstract

Jayanti's algorithm is one of the best known abortable mutual exclusion algorithms. A randomized approach has been used to overcome an already known limitation of the algorithm while preserving its all important properties and elegance. The limitation is that the token number used to assign process identification number to new incoming processes is unbounded. We have used some suitably adapted alternative data structure, in order to completely eliminate the use of token number, in the algorithm.