I am so grateful for this set of videos. My lecturer is a disaster, his slide notes are so bad that I have never been able to make sense of this stuff. Even the tutorial videos online currently are oh . . . . so . . . . bad, your's have great clarity, simple analogies with effective slides. A really fantastic job. Thank you!
I'm not sure how this explains anything, wondering how this video has such good rates and what I'm missing out on here. If the assumption is that "only one thread can be executing in the monitor at a time", why do we even need to worry about all of this. Doesn't the assumption itself already assume that the critical section problem is solved? Can't we just do the "eating" part directly inside of any of the monitor's functions and therefore use the fact that according to the definition, only that philosopher(/thread) is eating? Isnt the real problem and question here: how it is that this assumption is actually achieved?
