This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: School of Electrical Engineering and Computer Science University of Central Florida COP5611 - Advanced Operating Systems Spring 2009 (dcm) Homework 4. Due Wednesday March 4. Problem 1 (20 points) Two processes P 1 and P 2 share two resources R 1 and R 2 with one unit each. The state of a process is described by the vector [ h ( R 1 ) ,n ( R 1 ) ,h ( R 2 ) ,n ( R 2 )] meaning that the process has h ( R 1 ) and needs n ( R 1 ) units of R 1 , and has h ( R 2 ) and needs n ( R 2 ) units of R 2 . A process may only request, or release one unit of resource, either R 1 or R 2 , at a time. List all the states S to S 8 and all transitions for process P 1 (or P 2 ). Construct a state diagram of the system consisting of the two processes P 1 and P 2 and identify the states Sij, ≤ ( i,j ) ≤ 8 when the system is deadlocked. Problem 2 (20 points) Given a system with five processes, P 1 ,P 2 ,P 3 ,P 4 and P 5 and four types of resources, A,B,C and D each one with multiple units use the Banker’s Algorithm to find out if the...
View Full Document
- Fall '08
- Operating Systems, AirTrain Newark, Advanced Operating Systems, process P1, Current need P1