This is not the same as taking a lock across a couple of
lines of code to check or set a variable in a race-free
This is not the same as taking a lock across a couple of
lines of code to check or set a variable in a race-free
Many answers are implicitly predicated on the fact that Pintos
locks and semaphores have fair, first-come, first-served queuing.
Many answers are implicitly predicated on the fact that Pintos
locks and semaphores have fair, first-come, first-served queuing.
Many schemes are possible. For full credit, students must use an
algorithm that is at least as good as the second-chance (clock)
Many schemes are possible. For full credit, students must use an
algorithm that is at least as good as the second-chance (clock)