Szymanski's algorithm ( Mutual Exclusion): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3911:39, 15 February 2023‎ Admin talk contribs‎ 464 bytes +464‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Szymanski%27s_algorithm_(_Mutual_Exclusion)"