Naimi-Trehel's algorithm ( Mutual Exclusion)
Jump to navigation
Jump to search
Time Complexity
$O(\log n)$
Space Complexity
$O({1})$ per process, $O(n)$ total? communication variables?
(Each process keeps track of a constant number of variables (see algorithm description))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1996
Reference
https://www.sciencedirect.com/science/article/abs/pii/S0743731596900416