Revision as of 12:32, 27 November 2019 edit Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,588 edits MOS:HEAD ← Previous edit		Revision as of 08:10, 4 December 2019 edit undo Citation bot (talk \| contribs) Bots 5,865,113 edits m Removed URL that duplicated unique identifier. \| You can use this bot yourself. Report bugs here.\| Activated by User:Nemo bis \| via #UCB_webform Next edit →
Line 1: {{refimprove\|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\|url=https://dl.acm.org/citation.cfm?id=~~358537\|ref=origpaper}}</ref>. It was developed by [[Glenn Ricart]] and [[Ashok Agrawala]]. ==Algorithm==

Ricart–Agrawala algorithm: Difference between revisions