Peterson's algorithm ( Mutual Exclusion)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://zoo.cs.yale.edu/classes/cs323/doc/Peterson.pdf")
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