00:01
All right, continuing on with our computer science, a journey.
00:05
We're talking a little bit more about sharing and deadlock.
00:09
I mean, the idea here is imagine instead, let's talk about memory because that's an easier example to think about.
00:15
If i only have a gig of memory available, i have two processes that each one, half of it.
00:20
They each want, you know, 512 megabytes, a data of storage.
00:24
Well, that's great.
00:24
I can provide that to them.
00:26
And then they come back later and be like, actually i need another, you need 100 megabytes of storage.
00:30
You're like, well, i don't have that to offer you.
00:33
So maybe i can steal it from this other process to give it to you.
00:37
But essentially what you're having here is when we talk about the three deadlocks, if we look at number two, resources are requested on a partial basis, and then a process returns later to ask for more...