Ricart–Agrawala algorithm: Difference between revisions

Revision as of 23:54, 16 October 2020

Revision as of 19:40, 14 January 2021

Line 1:

{{refimprovemore citations needed|date=December 2009}}

The '''Ricart-AgrawalaRicart–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>ack</math> messages.<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|ref=origpaper}}</ref>. It was developed by [[Glenn Ricart]] and [[Ashok Agrawala]].

==Algorithm==

Line 43:

==References==

{{RefListReflist}}

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

{{DEFAULTSORT:Ricart-Agrawala Algorithm}}