Taubenfeld's black-white bakery algorithm ( Mutual Exclusion)
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? (https://link.springer.com/content/pdf/10.1007/b101206.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference == https://link.springer.com/chapter/10.1007/978-3-540-30186-8_5")
Time Complexity
$O(n)$
Space Complexity
$O({1})$ per process, $O(n)$ total? communication variables?
(https://link.springer.com/content/pdf/10.1007/b101206.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2004
Reference
https://link.springer.com/chapter/10.1007/978-3-540-30186-8_5