Example of a Resource Allocation Graph:
>P1 is holding an instance of R2 and requests instance of R1.>P2 is holding an intance of R1 and R2 and requests of instance of R3.
>P3 is holding an instance of R3.
>Is not a deadlock .
Resource Allocation Graph With A Deadlock:
>P1 is holding an instance of R2 and requests an instance of R1.
>P2 is holding an instance of R2 and R1 then requests of instance of R3.
>P3 is holding an instance of R3 and requests an instance of R2.
>is a deadlock.
Resource Allocation Graph With A Cycle But No Deadlock:
>P1 is holding an instance of R2 an requests an instance of R1.
>P2 is holding an instance of R1
>P3 is holding an instance of R1 and requests an instance of R2.
>P4 is holding an instance of R2.> is not a deadlock.
Resource-Allocation Graph For Deadlock Avoidance:
>P1 is holding R1 and P1 is claim edge to R2.
>P2 is requesting R1 and P2 is cliam edge to R2.
>is not a deadlock.
Unsafe State In Resource-Allocation Graph:
>P1 is holding R1 and pi is claim edge to R2.
>P2 is holding R2 and requests R1.
>is not a deadlock.
No comments:
Post a Comment