Revision as of 19:40, 14 January 2021 edit Yobot (talk \| contribs) Bots 4,733,870 edits m References after punctuation per WP:REFPUNCT, WP:CITEFOOT, WP:PAIC + other fixes Tag: AWB ← Previous edit		Revision as of 07:10, 15 November 2021 edit undo Citation bot (talk \| contribs) Bots 5,863,671 edits Add: s2cid. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar Next edit →
Line 1: {{more citations needed\|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>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\|s2cid=1779615\|ref=origpaper}}</ref> It was developed by [[Glenn Ricart]] and [[Ashok Agrawala]]. ==Algorithm==

Ricart–Agrawala algorithm: Difference between revisions