Raymond's algorithm ( Mutual Exclusion)

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)

Approximate?

Exact

Randomized?

No, deterministic

Year

1997

Reference

https://dl.acm.org/doi/abs/10.1145/58564.59295