Ricart–Agrawala algorithm
Algorithm for mutual exclusion on a distributed system / From Wikipedia, the free encyclopedia
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 messages.[1] It was developed by computer scientists Glenn Ricart and Ashok Agrawala.
This article needs additional citations for verification. (December 2009) |