Raymond's algorithm ( Mutual Exclusion)
Jump to navigation
Jump to search
Time Complexity
$O(\log n)$? (originally this had $O(n)$)
Space Complexity
$O({1})$ per process, $O(n)$ total? communication variables?
(https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.135.825&rep=rep1&type=pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/58564.59295