Consider the P and Q processes and the semaphores s and t with initial values equal to 1. The two processes perform the steps shown below. Find a sequence of execution of the steps of the two processes leading to a deadlock. Write the successive values received by the semaphores. Implement this system with p-threads. Find a proper values for the semaphores to avoid deadlocks.

Transcribed Image Text:

P Step P1: WAIT(s) Step P2: WAIT(t) Step P3: Critical section PA Step P4: SIGNAL(s) Step P5: WAIT(s) Step P6: Critical section PB Step P8: SIGNAL(t) Step Q1: WAIT(s) Step Q2: WAIT(t) Step Q3: Critical section QA Step Q4: SIGNAL(t) Step Q5: SIGNAL(s) Step P7: SIGNAL(s) P Step P1: WAIT(s) Step P2: WAIT(t) Step P3: Critical section PA Step P4: SIGNAL(s) Step P5: WAIT(s) Step P6: Critical section PB Step P8: SIGNAL(t) Step Q1: WAIT(s) Step Q2: WAIT(t) Step Q3: Critical section QA Step Q4: SIGNAL(t) Step Q5: SIGNAL(s) Step P7: SIGNAL(s)

Answer rating: 100% (QA)

Suppose we want to synchronize two concurrent processes P a... View the full answer