CS162 Lecture 12: Scheduling 3: Deadlock

In this lecture, we finish up our discussion of the Linux CFS scheduler and then proceed with a general discussion of Deadlock. After giving some examples of deadlock, we develop an algorithm for detecting deadlock and finish with the Banker’s algorithm for avoiding deadlock.