Last lecture, we were talking about mutual exclusion and locking, in some ports. And,
at the end of last lecture, we were talking about, how to implement the cell
cores if you don't have , drove by atomic operations, in your code. Or in your
architecture. And we just used Dekker's algorithm to help do that. And one of the
important, Dekker's algorithm, which was a shared variable in view processes. In
addition to effectively per process . . And we also just hinted on other sorts of,
mutual exclusion algorithms. , like, . which this is my bakery or, or deli
example. Where you into the deli, and you take a number. And then the number . And
the number you, somehow, . , because you need. Unlike the actual, when you go to
the deli. when you actually go to the bakery, no one's there pushing the button
. To the counter. So somehow you distribute the, counter incrementing. I'm
not going to go into too much detail on this, because, this is more for view of a,
. Which would be parallel computer architecture. Which I'm going to teach, in
the fall. If you guys want to come and learn more about parallel computer
architeture . We're going to talk about insequential and talk more about advanced
parallel machines. But And lots of other types of locks. So there's something
called MCS locks, and a bunch of that you don't use, a ton of operations to go
faster and have Allow you to have F-box on different memory group appearances and