Peterson's algorithm ( Mutual Exclusion)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O(n)$ total communication variables?
(see original paper ("requires $2n-1$ shared variables of size $n$"))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1981