Deadlock Characterization:Resource-Allocation Graph System resource-allocation graph:A directed graph oA set of vertices V and a set of edges E. V is partitioned into two types. P=(P1,P2,...,Pn),the set consisting of all the processes in the system. ★○Process R =(R1,R2,...,Rm),the set consisting of all resource types in the system. Resource Type with 4 instances 口⊙生年12月0C 陈香兰(C5,U5TO Operating System OS原理与设i计 March21,201913/45. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Deadlock Characterization: Resource-Allocation Graph System resource-allocation graph: A directed graph A set of vertices V and a set of edges E. V is partitioned into two types. ▶ P = {P1, P2, . . . , Pn}, the set consisting of all the processes in the system. ⋆ : Process ▶ R = {R1, R2, . . . , Rm}, the set consisting of all resource types in the system. ⋆ : Resource Type with 4 instances 陈香兰 (CS, USTC) Operating System OS原理与设计 March 21, 2019 13 / 45