Information | |
---|---|
has gloss | eng: 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. |
lexicalization | eng: Raymond's Algorithm |
instance of | c/Concurrency control algorithms |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint