Ricart–Agrawala algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 08:10, 4 December 2019 edit Citation bot (talk \| contribs) Bots 5,863,939 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 ← Previous edit		Latest revision as of 19:26, 15 November 2024 edit undo 192.197.54.31 (talk) Corrected See Also link for Nami-Trehel's Algorithm to point to existing Wikipedia page. Tag: Visual edit
(11 intermediate revisions by 9 users not shown)
Line 1: {{Short description\|Algorithm for mutual exclusion on a distributed system}} {{~~refimprove~~more citations needed\|date=December 2009}} The '''~~Ricart-Agrawala~~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>~~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 24 ⟶ 25: ===Performance=== * ~~Number~~Max number of network messages;: <math>2(N-1)</math> Synchronization Delays: One message propagation delay Line 40 ⟶ 41: * [[Suzuki–Kasami algorithm]] * [[Raymond's algorithm]] * [[Naimi–Trehel algorithm\|Naimi–Trehel's algorithm]] ==References== {{~~RefList~~Reflist}} *Maekawa, M., Oldehoeft, A., Oldehoeft, R.(1987). Operating Systems: Advanced Concept.Benjamin/Cummings Publishing Company, Inc. {{DEFAULTSORT:Ricart-Agrawala Algorithm}}