Mutual Exclusion Algorithm: Difference between revisions
From CasGroup
Jump to navigationJump to search
New page: '''Distributed mutual exclusion''' algorithms realize mutual exclusion in a distributed system. They are used to avoid the concurrent use of un-shareable resources a... |
|
| (One intermediate revision by one other user not shown) | |
(No difference)
| |
Latest revision as of 16:39, 11 February 2011
Distributed mutual exclusion algorithms realize mutual exclusion in a distributed system. They are used to avoid the concurrent use of un-shareable resources among distributed nodes or processes. Many different algorithms exist, for example the ones proposed by
- Lamport (1978)
- Ricart & Agrawala (1981)
- Maekawa (1985)
