Abstract—Jayanti’s algorithm is one of the best known abortable mutual exclusion algorithms. This work is an attempt 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 a suitably adapted alternative data structure, in order to completely eliminate the use of token number, in the algorithm. Keywords—Abortable, deterministic, local spin, mutual exclusion. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.