Question: Show how the following pseudo code could be modified to avoid deadlock. Explain your answer. Shared Variables: lockA, lockB, resourceA, resourceB Process1 { aquire(lockA); aquire(lockB);

Show how the following pseudo code could be modified to avoid deadlock. Explain your answer. Shared Variables: lockA, lockB, resourceA, resourceB Process1 { aquire(lockA); aquire(lockB); modify(resourceA); modify(resourceB); release(lockB); release(lockA); } Process2 { aquire(lockB); aquire(lockA); modify(resourceB); modify(resourceA); release(lockA); release(lockB); }

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!