An Operating Systems Vade Mecum

146 Resource Deadlock Chapter 4(d) A process is blocked on a resource-wait list.(e) A process releases a resource it had previously acquired.(f) A process increases its claim.(g) A process decreases its claim.(h) A process terminates.(i) A process is created and it makes its claim.12. We have shown for Habermann’s method that if S[i ] =−1 for some i , there is nosafe sequence. Show that if all S[i ] ≥ 0 for all i , there is a safe sequence.13. Show a situation in which there are several resource classes and for each classthere is a safe sequence but the situation is still unsafe.14. Find a situation in which the first-fit starvation control policy fails.15. Find a situation in which the first-fit starvation-control policy fails even when wemake partial allocations.16. Why is testing the length of the resource-wait list an inadequate measure of starvation?17. Why don’t we measure the length of time on the resource-wait list in virtual time?