Naimi-Trehel's algorithm ( Mutual Exclusion): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(logn)$ == Space Complexity == $O({1})$ per process, $O(n)$ total? communication variables? (Each process keeps track of a constant number of variables (see algorithm descriiption)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0743731596900416") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O({1})$ per process, $O(n)$ total? communication variables? | $O({1})$ per process, $O(n)$ total? communication variables? | ||
(Each process keeps track of a constant number of variables (see algorithm | (Each process keeps track of a constant number of variables (see algorithm description)) | ||
== Description == | == Description == | ||
Latest revision as of 07:56, 10 April 2023
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