Тёмный

Memory Partitioning 3: Buddy System 

Jacob Schrum
Подписаться 18 тыс.
Просмотров 59 тыс.
50% 1

The Buddy System is a compromise between fixed and dynamic partitioning. Though still inferior to paging and segmentation, it is used in certain limited contexts in some modern systems. Much of this material is based on content from the book Operating Systems: Internals and Design Principles by William Stallings.

Опубликовано:

 

19 июн 2017

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 51   
@HesterLiong
@HesterLiong 6 лет назад
Thanks buddy!
@muhammadapollo5236
@muhammadapollo5236 2 года назад
i know I am kind of randomly asking but does anyone know of a good place to watch new movies online ?
@kasebentley9406
@kasebentley9406 2 года назад
@Muhammad Apollo flixportal xD
@muhammadapollo5236
@muhammadapollo5236 2 года назад
@Kase Bentley thanks, signed up and it seems to work :) Appreciate it!!
@kasebentley9406
@kasebentley9406 2 года назад
@Muhammad Apollo you are welcome =)
@meyanh6238
@meyanh6238 2 года назад
@@kasebentley9406 This conversation here is such a fake-advertisement for a scam lol
@AntiContent
@AntiContent 3 года назад
This explanation is so much better than my textbook! Thanks!
@TheARN44
@TheARN44 6 лет назад
Best vid I could find with a visual explanation!
@user-pe6kw2df1n
@user-pe6kw2df1n 4 года назад
This vid helped me a lot understanding why coalescing is quite simple under the buddy sytstem. Thx!!!
@Farizgr8
@Farizgr8 6 лет назад
Quality description and precise... (y) great work..
@delyart
@delyart 4 года назад
Thank you so much for the great and vivid explanation
@smokymcmenziez
@smokymcmenziez 6 лет назад
Really good explanation, thanks Jacob!
@israelbango9198
@israelbango9198 6 лет назад
Thanks for the clear explanation!
@rtphi
@rtphi 6 лет назад
Thank you so much! very clear explanation!
@saadmanahmed4277
@saadmanahmed4277 3 года назад
So simple,so amazing
@buithanhlam3726
@buithanhlam3726 4 года назад
thanks, you make it so clear!
@AbhishekSingh-og7kf
@AbhishekSingh-og7kf 4 года назад
Such a nice explanation 👌
@aroobazaman2939
@aroobazaman2939 5 месяцев назад
difficult but you did great and explained as simple as possible
@Jessica-ky9fq
@Jessica-ky9fq 6 лет назад
thanks!! beautifully explained
@jamesli6932
@jamesli6932 6 лет назад
Thank you ! it help me a lot
@marmrmaaat512
@marmrmaaat512 3 года назад
Thanks! very well explained!
@zaktv3595
@zaktv3595 6 лет назад
thanks, that was very helpful
@flexer7822
@flexer7822 3 года назад
Amazing video! - No indian acent - Perfect audio - To easy to understand it 10/10
@gnir6518
@gnir6518 3 года назад
What you got against Indian accents?
@flexer7822
@flexer7822 3 года назад
@@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
@zergl1ng526
@zergl1ng526 2 года назад
@@gnir6518 they're unclear
@frontback4574
@frontback4574 8 месяцев назад
​@@gnir6518they just read from book
@dannggg
@dannggg 2 года назад
the best explanation
@jyothina9466
@jyothina9466 6 лет назад
Thank you very much!!
@Titokstro1
@Titokstro1 6 лет назад
Thank you!
@ninaerasmus4796
@ninaerasmus4796 6 лет назад
Thank You!
@mALIH0793054752
@mALIH0793054752 3 года назад
thank u so much bro
@user-ww8hm6ke4u
@user-ww8hm6ke4u 2 года назад
thanks a lot
@mohbehnia
@mohbehnia 5 лет назад
Good example
@MysticPrince101
@MysticPrince101 3 года назад
if i have an external fragment larger than a requested memory process, can i allocate said process into the external fragment?
@jritzeku
@jritzeku 3 года назад
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??
@RishiRaj95
@RishiRaj95 3 года назад
Awesome Video, pro tip use 1.5x speed
@RM-lb7xw
@RM-lb7xw 3 года назад
Ur a genius
@jenweatherwax7113
@jenweatherwax7113 2 года назад
❤️❤️❤️❤️
@sistaraghuram1036
@sistaraghuram1036 7 лет назад
Is there any real time application for this ?
@orgamliel7700
@orgamliel7700 2 года назад
Great job, 2^10 is your grade here
@LusidDreaming
@LusidDreaming 2 года назад
Why do we always favor the portion on top?
@kamalezzeghoudy4262
@kamalezzeghoudy4262 2 года назад
So we can disactive the budy systeam 2
@Kenbomp
@Kenbomp 3 года назад
Actually it's used in Linux so it's quite power ful
@dimitrygrozny7546
@dimitrygrozny7546 5 лет назад
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.
@bakbak4960
@bakbak4960 5 лет назад
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.
@jenweatherwax7113
@jenweatherwax7113 2 года назад
This is historic. It’s not how modern memory management works. It’s just something college students are forced to learn for exams.
@porogonzales6267
@porogonzales6267 3 года назад
TNX BUD.but the voice is low
@BACSShaileshShettar
@BACSShaileshShettar 3 года назад
tooo low
@rms46
@rms46 5 лет назад
Example at 1:15
Далее
But, what is Virtual Memory?
20:11
Просмотров 208 тыс.
Memory Partitioning 2: Dynamic Partitioning
12:38
Просмотров 25 тыс.
Paging and Segmentation 3: Virtual Memory Paging
19:20
Paging and Segmentation 1: Simple Paging
18:40
Просмотров 33 тыс.
Paging (OS)
29:12
Просмотров 71 тыс.
Running a Buffer Overflow Attack - Computerphile
17:30
Second Chance Algorithm
10:04
Просмотров 45 тыс.
Segmented, Paged and Virtual Memory
7:48
Просмотров 230 тыс.
What is virtual memory? - Gary explains
11:28
Просмотров 295 тыс.
File Systems 1: File Indexes with B-Trees
12:36
Просмотров 25 тыс.