%0 Journal Article
	%A Awadhesh Kumar Singh
	%D 2008
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 14, 2008
	%T On Bounding Jayanti's Distributed Mutual Exclusion Algorithm
	%U https://publications.waset.org/pdf/1133
	%V 14
	%X 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.

	%P 329 - 335