Chan-Singhal-Liu ( Mutual Exclusion)

Time Complexity

$O(\log n)$

Space Complexity

$O({1})$ per process, $O(n)$ total? communication variables?

(Each process seems to keep track of a constant number of variables (see algorithm description))

Approximate?

Exact

Randomized?

No, deterministic

Year

1990

Reference

https://ieeexplore.ieee.org/document/113817