Taubenfeld's black-white bakery algorithm ( Mutual Exclusion)
Jump to navigation
Jump to search
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