Chan-Singhal-Liu ( Mutual Exclusion)
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 seems to keep track of a constant number of variables (see algorithm descriiption)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/113817")
Time Complexity
$O(logn)$
Space Complexity
$O({1})$ per process, $O(n)$ total? communication variables?
(Each process seems to keep track of a constant number of variables (see algorithm descriiption))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1990
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/113817