Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion)

From Algorithm Wiki

Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == communication variables? () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1963 == Reference == -")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

communication variables?

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1963

Reference

-

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Dekker%27s_algorithm_(2-thread_Mutual_Exclusion_Mutual_Exclusion)&oldid=45263"