A system has four processes and five allocated resources. The current allocation and maximum needs Give the smallest value of “x” for which this is a safe state?
Suppose a system that is neither deadlocked nor safe. It means some processes (p1, p2, and p3) are in working condition but may lead to deadlock for any further requirement. Give an example of such system by considering at least 3 processes (P1, P2, P3) and 4 resources (A, B, C, and D). Prove by drawing a matrix of (allocated, need, available) that all states are neither deadlocked nor safe.
No comments:
Post a Comment