Maekawa's algorithm ( Mutual Exclusion)
Jump to navigation
Jump to search
Time Complexity
$O(n^{0.5})$
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
1985
Reference
https://cseweb.ucsd.edu/classes/wi09/cse223a/p145-maekawa.pdf