Question: Assume that a user program is implented with two kernel-level threads, T1 and T2. These two threads can use Petersons algorithm to lock critical sections,
Assume that a user program is implented with two kernel-level threads, T1 and T2. These two threads can use Petersons algorithm to lock critical sections, without requiring traps to the kernel. Let us assume that T1 has gained access to the critical section. Even if the critical section comprises just a few instructions, T2 might spin wait for thousands of instructions. How can this happen?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
