?Three concurrent processes X, Y, and Z execute three different code segments th

Question

?Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the
following represents a deadlock-free order of invoking the P operations by the processes?

Explanation / Answer

X: P(a)P(b)P(c)      Y: P(b)P(c)P(d)      Z: P(c)P(d)P(a)

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.