Mutual Exclusion Algorithm

From CasGroup
Revision as of 14:58, 2 October 2008 by Jfromm (talk | contribs) (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...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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)