Szymanski's algorithm ( Mutual Exclusion)

From Algorithm Wiki
Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ per process, $O(n)$ total? communication variables? (http://cs.rpi.edu/~szymansk/papers/jerus.93.pdf (kinda)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1988 == Reference == https://www.researchgate.net/publication/221235887_A_simple_solution_to_Lamport's_concurrent_programming_problem_with_linear_wait")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ per process, $O(n)$ total? communication variables?

(http://cs.rpi.edu/~szymansk/papers/jerus.93.pdf (kinda))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1988

Reference

https://www.researchgate.net/publication/221235887_A_simple_solution_to_Lamport's_concurrent_programming_problem_with_linear_wait

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Szymanski%27s_algorithm_(_Mutual_Exclusion)&oldid=44664"