Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)
Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ (adding 1 arbitrator, which is of constant size) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1965 == Reference == https://en.wikipedia.org/wiki/Dining_philosophers_problem#Arbitrator_solution")
Time Complexity
$O({2}^n)$
Space Complexity
$O({1})$
(adding 1 arbitrator, which is of constant size)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1965
Reference
https://en.wikipedia.org/wiki/Dining_philosophers_problem#Arbitrator_solution