@@gnir6518 i don't speak english, that is the first point The second point, is very dificult to my to understand a normal english accent, imagine if the accent is from india, dude is impossible
At 8:59, after removing process A, you coalesced it (removing the line for 32). At this point, is it possible to move the process C (value of 60) up so that it is is placed between 64-128? This would coalesce/remove line 192. Perhaps, this procedure is avoided since it is kind of like compaction??
why not just use pointers so f u have 6M of space left in one area and 5M in another and u need 10M, just use up 6M in the first and then have a pointer to the loction of the begining of the 5M area and add the last 4M on there. SO basicly kind of like spliting up 1 varable into two diffrent locations.
that is actually how the Hard Drive Disks split the data to fill empty spaces, instead of leaving gaps between files (that is why disk fragmentation is a good thing to do every once in a while to rearrange the splited data into one continuous unsplited file). However, I believe that starting from a pointer that is equals to 2^n is much faster (i think, don't take it as a fact). And the memory is going to be cleared before shutdown anyways, so filling up the gaps isn't that important as long as there is enough space for all the process on the memory for the time being.
Thanks buddy!
i know I am kind of randomly asking but does anyone know of a good place to watch new movies online ?
@Muhammad Apollo flixportal xD
@Kase Bentley thanks, signed up and it seems to work :) Appreciate it!!
@Muhammad Apollo you are welcome =)
@@kasebentley9406 This conversation here is such a fake-advertisement for a scam lol
This explanation is so much better than my textbook! Thanks!
Best vid I could find with a visual explanation!
This vid helped me a lot understanding why coalescing is quite simple under the buddy sytstem. Thx!!!
difficult but you did great and explained as simple as possible
Quality description and precise... (y) great work..
Thanks for the clear explanation!
Amazing video!
- No indian acent
- Perfect audio
- To easy to understand it
10/10
What you got against Indian accents?
@@gnir6518 i don't speak english, that is the first point
The second point, is very dificult to my to understand a normal english accent, imagine if the accent is from india, dude is impossible
@@gnir6518 they're unclear
@@gnir6518they just read from book
So simple,so amazing
Thank you so much for the great and vivid explanation
Thank you❤
Giving you your flowers💐💐❤
Really good explanation, thanks Jacob!
Such a nice explanation 👌
the best explanation
Thank you so much! very clear explanation!
thanks!! beautifully explained
Awesome Video, pro tip use 1.5x speed
Thank you very much!!
Thank you ! it help me a lot
Why do we always favor the portion on top?
if i have an external fragment larger than a requested memory process, can i allocate said process into the external fragment?
thanks a lot
thanks, that was very helpful
thank u so much bro
Great job, 2^10 is your grade here
Thank You!
At 8:59, after removing process A, you coalesced it (removing the line for 32). At this point, is it possible to move the process C (value of 60) up so that it is is placed between 64-128? This would coalesce/remove line 192. Perhaps, this procedure is avoided since it is kind of like compaction??
Good example
So we can disactive the budy systeam 2
Ur a genius
❤️❤️❤️❤️
Is there any real time application for this ?
Actually it's used in Linux so it's quite power ful
why not just use pointers so f u have 6M of space left in one area and 5M in another and u need 10M, just use up 6M in the first and then have a pointer to the loction of the begining of the 5M area and add the last 4M on there. SO basicly kind of like spliting up 1 varable into two diffrent locations.
that is actually how the Hard Drive Disks split the data to fill empty spaces, instead of leaving gaps between files (that is why disk fragmentation is a good thing to do every once in a while to rearrange the splited data into one continuous unsplited file).
However, I believe that starting from a pointer that is equals to 2^n is much faster (i think, don't take it as a fact).
And the memory is going to be cleared before shutdown anyways, so filling up the gaps isn't that important as long as there is enough space for all the process on the memory for the time being.
This is historic.
It’s not how modern memory management works.
It’s just something college students are forced to learn for exams.
TNX BUD.but the voice is low
tooo low
Example at 1:15
thanks, you make it so clear!
Thanks! very well explained!
Thank you!