Naimi-Trehel's algorithm ( Mutual Exclusion)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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