Это видео недоступно.
Сожалеем об этом.

Paging (OS)

Поделиться
HTML-код
  • Опубликовано: 2 авг 2024
  • In this video, we will discuss the basics of paging, how we might implement paging, followed by some examples of how to calculate the number of memory frames a computer has based on the specifications, how many bits are needed for displacement into a page in the page table etc.
    This video was developed for the CSCE 311 Operating Systems class at the University of South Carolina in response to the COVID-19 pandemic.

Комментарии • 75

  • @firdausfadzil4857
    @firdausfadzil4857 2 года назад +208

    watching this 1 hour before Operating System Final Exam

  • @blakeanderson9239
    @blakeanderson9239 2 года назад +21

    Every other explanation I could find was highly technical. This was the first I could find that actually made sense. Thank you!

  • @JoseRamos-nu8kd
    @JoseRamos-nu8kd 2 года назад +3

    Great video, really informative and well explained. Thank you

  • @gno7553
    @gno7553 Год назад

    Vous expliquez superbement bien, j'ai pu compléter ma compréhension.

  • @sandro-nd6ir
    @sandro-nd6ir 2 года назад

    Very underrated video. Helped me a lot. Thank you!

  • @richardlam4307
    @richardlam4307 11 месяцев назад

    You helped me out with my operating systems class, thank you!!

  • @nerduser1000
    @nerduser1000 2 месяца назад

    the only video which cleared the concept for me
    thank you casey

  • @albertofabbri1543
    @albertofabbri1543 2 года назад +1

    Thank you very much for the exercise, it was very useful!

  • @salmadiaaelabsi
    @salmadiaaelabsi 6 месяцев назад

    incredible video, thank you so much for your efforts!

  • @sarvottamswaroop262
    @sarvottamswaroop262 8 месяцев назад

    thanks a lot for these lectures!

  • @tommasoc.2207
    @tommasoc.2207 Месяц назад

    THANK YOU A LOT. This is the video that finally made me understand the topic

  • @Tchesi
    @Tchesi 6 месяцев назад

    Thanks very much for this explanation 👏👏👏

  • @z40140110
    @z40140110 2 года назад

    excellent video, thank you!

  • @bang2706
    @bang2706 3 месяца назад

    Thank you, the example is very easy to understand

  • @MS-qh3iz
    @MS-qh3iz Год назад

    loved the video! thank you so much!! :)

  • @nerometallica8677
    @nerometallica8677 2 месяца назад

    crystal clear explanation, thanks

  • @PoetrybyEraj6
    @PoetrybyEraj6 6 месяцев назад +3

    watching this 2 hour before Operating System Final Exam. incredible video😉🥰

  • @NEMOBANDZBEATS
    @NEMOBANDZBEATS 2 года назад +2

    I been struggling to understand so bad. This video was super helpful

    • @weamhaleemi4984
      @weamhaleemi4984 2 года назад

      any idea how 4KB was displayed on 12 bits? i d\think she did a miscalculation

  • @shadhussain12
    @shadhussain12 Год назад

    Super clear explanation of concepts. Great video

  • @h.k3260
    @h.k3260 2 месяца назад +1

    Hi,
    Great vid! Can anybody explain why we even need a page offset to begin with, I get as she explains it is to 6:54 "get to the spot in memory we are looking for". Like what, surely where a frame starts thats where the process' page start(like i se thats not the case, but why).
    Current understanding is: A page is a division of a process (a process is splitt evenly into pages). But where a process starts in RAM why is it stored with an offset from the a frames start.

  • @omerfarukbulut9295
    @omerfarukbulut9295 Год назад

    Really helpful thanks !

  • @0xatul
    @0xatul Год назад

    Great Explanation

  • @lebanesewiseman1347
    @lebanesewiseman1347 2 месяца назад +2

    We have an exam 2mrw ... Pray for us

  • @nouhafougi1877
    @nouhafougi1877 2 месяца назад

    Thank you ma'am you have saved me

  • @ordered_saddle5
    @ordered_saddle5 3 года назад +3

    thank you soo much

  • @logic9948
    @logic9948 2 года назад +2

    appreciate it a lot =)

  • @MrEddyLan
    @MrEddyLan 9 месяцев назад

    Question about Q4: don’t we need 36*2 bits per entry to store the mapping from page number to frame number (36 bits each)?
    Thanks for the helpful video!

    • @Adrianmwaura
      @Adrianmwaura Месяц назад

      something also looks off to me about her calculations

  • @refrank7684
    @refrank7684 Год назад +14

    I think the mathematical explanation is all good except that paging actually doesn't guarantee internal fragmentation will be avoided. of course external fragmentation would no longer be an issue but internal fragmentation will always be there.For example, if page size
    is 2,048 bytes, a process of 72,766 bytes will need 35 pages plus 1,086 bytes. It
    will be allocated 36 frames, resulting in internal fragmentation of 2,048 − 1,086
    = 962 bytes. In the worst case, a process would need n pages plus 1 byte. It
    would be allocated n + 1 frames, resulting in internal fragmentation of almost
    an entire frame. [Source: Operating system concepts by Abraham Silberschatz ...]

  • @MikeLinton-uo4qt
    @MikeLinton-uo4qt 3 месяца назад +1

    MCs and cs students before main exam 😂

  • @user-ng8rl3jb1i
    @user-ng8rl3jb1i 2 года назад +1

    nice one !

  • @elwiswo
    @elwiswo 2 года назад +1

    she deserves more subs

  • @bilecode8114
    @bilecode8114 Год назад

    Thanks Dera Darling🤗

  • @hamida.1054
    @hamida.1054 Год назад

    But you said number of entries in page table means number of pages! which was 2^36. Later, on question 4, you calculated the number of pages 2^27! which one is wrong? is number of entries in the page number not equal to number of pages in the table? or there was something wrong with calculation?

  • @konradw360
    @konradw360 8 месяцев назад

    Thank you

  • @floatoss
    @floatoss 15 дней назад

    In question 4 (at 23:48 to be precise), each entry in the page table is going to hold a frame number at max, right? We know that we have 2^{32} frames (done at 17:30) in our system. Now, we have 2^{36} entries in the page table with each entry holding a possible 32 bit value referencing the frame (we don't really need 64 bits for this), giving us the total size of page table as 2^{36} * ( 32 bits), right? You have it as 2^{36} * ( 64 bits). Where am I wrong?

  • @b213videoz
    @b213videoz Месяц назад

    0:45 so I'm not alone confusing "contiguous" with "continuous" 😊

  • @ashrafurrahman750
    @ashrafurrahman750 9 месяцев назад

    thank you

  • @theworldintheweek6850
    @theworldintheweek6850 2 года назад

    Thanks

  • @furgly6529
    @furgly6529 Месяц назад

    What’s an Offset , Address , Indexing ??

  • @CryptAmine
    @CryptAmine День назад

    27:45
    How is 1GB × 512B = 512GB
    Why is the result unit is GB ?

  • @PowerCatto
    @PowerCatto Год назад

    Wish me luck Bois, I have OS exam tomorrow

  • @ImtithalSaeed
    @ImtithalSaeed 2 года назад

    can offset be zero?

  • @techno_gamerz4446
    @techno_gamerz4446 Год назад +1

    Watching at 2x speed, 15 mins before the exam.

    • @CryptAmine
      @CryptAmine День назад

      What university year do you study this ?

  • @user-oz6rk6db1m
    @user-oz6rk6db1m 5 месяцев назад

    can u give us the slide
    and thnxs

  • @CODFactory
    @CODFactory Год назад

    For Question 3, around 22:50 timestamp, the virtual memory is answered as 2^48, however, why does it matter if it takes 36 bits to index into page table? if the machine is a 64 bit machine, then the virtual memory has to be 2^64 isn't it? and that gets divided into 4kb pages.....or that question now ignores that machine is 64 bit and makes it into a 48 bit machine?

    • @mihaicotin3261
      @mihaicotin3261 10 месяцев назад

      On x64 48 bits are used for paging if I’m not mistaking , not whole 64

  • @snarf45
    @snarf45 Месяц назад +1

    For people who may be confused, what she is referring to as 'virtual memory' is actually called logical memory. Virtual memory is a whole different thing

  • @4ripw
    @4ripw 5 месяцев назад

    Casey's cheeks

  • @Donald_486w
    @Donald_486w 14 дней назад

    Brace yourself, cash refund incoming