Lamport's bakery algorithm ( Mutual Exclusion)
Revision as of 10: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? (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 == 1974 == Reference == http://lamport.azurewebsites.net/pubs/bakery.pdf")
Time Complexity
$O(n)$
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
1974