Suzuki-Kasami's algorithm ( Mutual Exclusion)

From Algorithm Wiki
Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$? (originally this had $O(logn)$) == 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://cse.iitkgp.ac.in/~agupta/distsys/Mutex-SuzukiKasami.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$? (originally this had $O(logn)$)

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://cse.iitkgp.ac.in/~agupta/distsys/Mutex-SuzukiKasami.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Suzuki-Kasami%27s_algorithm_(_Mutual_Exclusion)&oldid=44668"