Paging (OS)

Поділитися
Вставка
  • Опубліковано 5 сер 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

  • @sandro-nd6ir
    @sandro-nd6ir 2 роки тому

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

  • @nerduser1000
    @nerduser1000 2 місяці тому

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

  • @richardlam4307
    @richardlam4307 Рік тому

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

  • @tommasoc.2207
    @tommasoc.2207 2 місяці тому

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

  • @gno7553
    @gno7553 Рік тому

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

  • @salmadiaaelabsi
    @salmadiaaelabsi 6 місяців тому

    incredible video, thank you so much for your efforts!

  • @sarvottamswaroop262
    @sarvottamswaroop262 8 місяців тому

    thanks a lot for these lectures!

  • @albertofabbri1543
    @albertofabbri1543 2 роки тому +1

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

  • @MS-qh3iz
    @MS-qh3iz Рік тому

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

  • @z40140110
    @z40140110 2 роки тому

    excellent video, thank you!

  • @Tchesi
    @Tchesi 6 місяців тому

    Thanks very much for this explanation 👏👏👏

  • @bang2706
    @bang2706 3 місяці тому

    Thank you, the example is very easy to understand

  • @nerometallica8677
    @nerometallica8677 2 місяці тому

    crystal clear explanation, thanks

  • @omerfarukbulut9295
    @omerfarukbulut9295 Рік тому

    Really helpful thanks !

  • @PoetrybyEraj6
    @PoetrybyEraj6 6 місяців тому +3

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

  • @floatoss
    @floatoss 18 днів тому

    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?

  • @logic9948
    @logic9948 2 роки тому +2

    appreciate it a lot =)

  • @0xatul
    @0xatul Рік тому

    Great Explanation

  • @ordered_saddle5
    @ordered_saddle5 3 роки тому +3

    thank you soo much

  • @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

  • @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.

  • @nouhafougi1877
    @nouhafougi1877 2 місяці тому

    Thank you ma'am you have saved me

  • @lebanesewiseman1347
    @lebanesewiseman1347 2 місяці тому +2

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

  • @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?

  • @user-ng8rl3jb1i
    @user-ng8rl3jb1i 2 роки тому +1

    nice one !

  • @shadhussain12
    @shadhussain12 Рік тому

    Super clear explanation of concepts. Great video

  • @elwiswo
    @elwiswo 2 роки тому +1

    she deserves more subs

  • @bilecode8114
    @bilecode8114 Рік тому

    Thanks Dera Darling🤗

  • @MikeLinton-uo4qt
    @MikeLinton-uo4qt 3 місяці тому +1

    MCs and cs students before main exam 😂

  • @konradw360
    @konradw360 8 місяців тому

    Thank you

  • @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

  • @ashrafurrahman750
    @ashrafurrahman750 9 місяців тому

    thank you

  • @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 ...]

  • @theworldintheweek6850
    @theworldintheweek6850 2 роки тому

    Thanks

  • @b213videoz
    @b213videoz 2 місяці тому

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

  • @CryptAmine
    @CryptAmine 4 дні тому

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

  • @furgly6529
    @furgly6529 Місяць тому

    What’s an Offset , Address , Indexing ??

  • @techno_gamerz4446
    @techno_gamerz4446 Рік тому +1

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

    • @CryptAmine
      @CryptAmine 4 дні тому

      What university year do you study this ?

  • @ImtithalSaeed
    @ImtithalSaeed 2 роки тому

    can offset be zero?

  • @PowerCatto
    @PowerCatto Рік тому

    Wish me luck Bois, I have OS exam tomorrow

  • @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

  • @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

  • @user-oz6rk6db1m
    @user-oz6rk6db1m 5 місяців тому

    can u give us the slide
    and thnxs

  • @4ripw
    @4ripw 5 місяців тому

    Casey's cheeks

  • @Donald_486w
    @Donald_486w 17 днів тому

    Brace yourself, cash refund incoming