Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
$O(n)$
(each fork has a mutex and there are O(n) forks)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1965
Reference
https://en.wikipedia.org/wiki/Dining_philosophers_problem#Resource_hierarchy_solution