Raymond's algorithm ( Mutual Exclusion): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(logn)$? (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) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(\log n)$? (originally this had $O(n)$) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 29: | Line 29: | ||
1997 | 1997 | ||
== Reference == | == Reference == | ||
https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/58564.59295 | |||
Latest revision as of 07:55, 10 April 2023
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)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/58564.59295