Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance)

From Algorithm Wiki

Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Resource_hierarchy_solution_(Dining_Philosophers_Problem_Deadlock_Avoidance)&oldid=44681"