Jump to content

Raymond's algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Estrabd (talk | contribs) at 22:56, 21 November 2007 (Created page with ''''Raymond's Algorithm''' is a token based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on dis...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Raymond's Algorithm is a token based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed resources. As defined, each node has only a single parent, to which all requests to attain the token are made.


See also