Ricart–Agrawala algorithm: Difference between revisions

Revision as of 23:54, 16 October 2020

Latest revision as of 19:26, 15 November 2024

(7 intermediate revisions by 7 users not shown)

Line 1:

{{Short description|Algorithm for mutual exclusion on a distributed system}}

{{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>release 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|s2cid=1779615|ref=origpaper|doi-access=free}}</ref>. It was developed by computer scientists [[Glenn Ricart]] and [[Ashok Agrawala]].

==Algorithm==

Line 40 ⟶ 41:

* [[Suzuki–Kasami algorithm]]

* [[Raymond's algorithm]]

* [[Naimi–Trehel algorithm|Naimi–Trehel's algorithm]]

==References==

{{RefListReflist}}

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

{{DEFAULTSORT:Ricart-Agrawala Algorithm}}