关于环和死锁 ☆ If graph contains no cycles→ no deadlock ☆ f graph contains a cycle→了 if only one instance per resource type, then deadlock if several instances per resource type, possibility of de eadloc k 嵌入式系统实验室 EMBEDDED SYSTEM LAB口RAT口RY SU:MDU INTHUTE OR AOVANCLD STUOY D USTt关于环和死锁 ❖If graph contains no cycles  no deadlock ❖If graph contains a cycle  ➢if only one instance per resource type, then deadlock ➢if several instances per resource type, possibility of deadlock