Question: 3 pts Question 9 There are four cooperating processes. Assume P1 and P2 do not share an input device. Using semaphores, what is the minimum
3 pts Question 9 There are four cooperating processes. Assume P1 and P2 do not share an input device. Using semaphores, what is the minimum number of semaphores that could be used to solve this situation. How many would be initialized to 0 and how many would be initialized to 1

question 9
Spinlocks can be used to prevent busy waiting in the implementation of semaphore A counting semaphore can never be used as a binary semaphore D Question 9 3 pts There are four cooperating processes. Assume P1 and P2 do not share an input device. Using semaphores, what is the minimum number of semaphores that could be used to solve this situation. How many would be initialized to O and how many would be initialized to 1: P4: P3: Z-Y 2 print(X) W X-Z print(Y) P2: Pl: input (a) input (b) Y=a+b print(W) O 7 initialized to 1 1 initialized to 0 and 5 initialized to 1 O 7 initialized to 0 O 7 initialized to 0 and 1 initialized to 1 "DI Question 10 1.5 pts In a resource-allocation graph
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
