@article{40,
  author = {Ousmane Thiare},
  title = {A Solution to Improve Algorithm for Distributed Mutual Exclusion by Restricting Message Exchange in Quorums},
  journal = {Journal of Information Technology Review},
  year = {2010},
  volume = {1},
  number = {2},
  doi = {},
  url = {http://www.dline.info/jitr/fulltext/v1n203.pdf},
  abstract = {Resource management is one of the most important and fun damental problems in distributed systems. Typically, to maintain the integrity of a resource, at most one process should access the resource at any time. As a result, accesses to the same resource (that is, exe cution of critical sections) by different processes have to be serialized. This problem is referred to as the ”mutual exclusion problem”. In this paper, we have proposed a permission based distributed mutual exclu sion algo- rithm which is an improvement of Maekawa’s algorithm. The number of messages required by the improvised algorithm is in the range 3M to 5M per critical section invocation where M is the number of in tersection nodes in the system. A reduction in number of message by restricting the communication of any node with the intersection nodes of the quorums, without any modification of the basic structure of the algorithm. },
}