Mutual Exclusion Algorithm
From CasGroup
| Line 1: | Line 1: | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
'''Distributed mutual exclusion''' algorithms realize mutual exclusion in a [[Distributed System|distributed system]]. | '''Distributed mutual exclusion''' algorithms realize mutual exclusion in a [[Distributed System|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 | 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) | * Lamport (1978) | ||
| - | * Ricart & | + | * Ricart & Agrawala (1981) |
* Maekawa (1985) | * Maekawa (1985) | ||
[[Category:Distributed Algorithms]] | [[Category:Distributed Algorithms]] | ||
