1
00:00:03,140 --> 00:00:09,335
Last lecture, we were talking about mutual
exclusion and locking, in some ports. And,

2
00:00:09,335 --> 00:00:15,002
at the end of last lecture, we were
talking about, how to implement the cell

3
00:00:15,002 --> 00:00:21,575
cores if you don't have , drove by atomic
operations, in your code. Or in your

4
00:00:21,575 --> 00:00:27,620
architecture. And we just used Dekker's
algorithm to help do that. And one of the

5
00:00:27,620 --> 00:00:33,513
important, Dekker's algorithm, which was a
shared variable in view processes. In

6
00:00:33,513 --> 00:00:40,689
addition to effectively per process . .
And we also just hinted on other sorts of,

7
00:00:40,902 --> 00:00:48,709
mutual exclusion algorithms. , like, .
which this is my bakery or, or deli

8
00:00:48,709 --> 00:00:55,950
example. Where you into the deli, and you
take a number. And then the number . And

9
00:00:55,950 --> 00:01:03,899
the number you, somehow, . , because you
need. Unlike the actual, when you go to

10
00:01:03,899 --> 00:01:10,288
the deli. when you actually go to the
bakery, no one's there pushing the button

11
00:01:10,288 --> 00:01:15,545
. To the counter. So somehow you
distribute the, counter incrementing. I'm

12
00:01:15,545 --> 00:01:20,063
not going to go into too much detail on
this, because, this is more for view of a,

13
00:01:20,063 --> 00:01:24,920
. Which would be parallel computer
architecture. Which I'm going to teach, in

14
00:01:24,920 --> 00:01:29,043
the fall. If you guys want to come and
learn more about parallel computer

15
00:01:29,043 --> 00:01:34,239
architeture . We're going to talk about
insequential and talk more about advanced

16
00:01:34,239 --> 00:01:38,870
parallel machines. But And lots of other
types of locks. So there's something

17
00:01:38,870 --> 00:01:43,897
called MCS locks, and a bunch of that you
don't use, a ton of operations to go

18
00:01:44,066 --> 00:01:50,286
faster and have Allow you to have F-box on
different memory group appearances and