Copyright Notice: Copyright by CMPUT 379, U. of Alberta, course instructor (E. Elmallah). All rights reserved. Do not post any part on a publicly-available Web site.
Question 4 (v1) [12 points]
Consider the following snapshot of a system with five processes (p1, ¡¤ ¡¤ ¡¤ , p5) and four re- sources (r1, ¡¤ ¡¤ ¡¤ , r4). There are no current outstanding unsatisfied requests.
currently available resources
Copyright By PowCoder代写 加微信 powcoder
r1 r2 r3 r4 2100
current allocation maximum demand still needs
Process r1 r2 r3 r4 Process r1 r2 r3 r4 Process r1 r2 r3 r4 p1 0012 p1 0012 p1
p2 2000 p2 2750 p2 p3 0034 p3 6656 p3 p4 2354 p4 4356 p4 p5 0332 p5 0652 p5
1. Copy and complete the ¡®still needs¡¯ table by writing what each process might still request.
2. Is the system currently deadlocked, deadlock-unsafe, or deadlock safe? Explain your answer.
Circle one: deadlocked deadlock-unsafe deadlock safe
3. If a request from p3 arrives for (0,1,0,0), can that request be safely granted immedi- ately? Explain your answer.
Circle one: YES NO
University of Alberta examination University of Alberta examination
University of Alberta examination
University of Alberta examination University of Alberta examination
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com