Location of Repository

International Journal of Electrical and Computer Engineering 3:10 2008 On Bounding Jayanti’s Distributed Mutual Exclusion Algorithm

By Awadhesh Kumar Singh

Abstract

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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.360.1325
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.waset.org/journals/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.