Ricart–Agrawala algorithm: Difference between revisions

Revision as of 18:26, 23 December 2017

Revision as of 18:34, 23 December 2017

Line 1:

<ref>{{cite journal|last1=Ricart|first1=Glenn|last2=Agrawala|first2=Ashok K.|title=An optimal algorithm for mutual exclusion in computer networks|journal=Communications of the ACM|date=1 January 1981|volume=24|issue=1|pages=9–17|doi=10.1145/358527.358537|url=https://dl.acm.org/citation.cfm?id=358537|ref=origpaper}}</ref>{{Unreferenced|date=December 2009}}

{{Unreferenced|date=December 2009}}

The '''Ricart-Agrawala Algorithm''' is an algorithm for [[mutual exclusion]] on a [[distributed system]]. This algorithm is an extension and optimization of [[Lamport's Distributed Mutual Exclusion Algorithm]], by removing the need for <math>release</math> messages. It was developed by [[Glenn Ricart]] and [[Ashok Agrawala]].

Line 43:

==References==

{{RefList}}

*Glen Ricart, Ashok K. Agrawala (1981). Communications of the ACM: [https://dl.acm.org/citation.cfm?id=358537 An optimal algorithm for mutual exclusion in computer networks]

*Maekawa, M.,Oldehoeft, A.,Oldehoeft, R.(1987). Operating Systems: Advanced Concept.Benjamin/Cummings Publishing Company, Inc.