Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    in A Paging System, It Takes 30 Ns To Search Translation Lookaside Buffer (TLB) and

    Uploaded by

    Mahmoud Abdel-Salam
    The document describes two scenarios involving translation lookaside buffers (TLBs) and their impact on effective memory access times. In the first scenario, with a 30ns TLB search time, 90ns memory access time, and 70% TLB hit ratio, the effective memory access time is 120ns. In the second scenario, with a 10ms TLB search time, 80ms memory access time, and 60% TLB hit ratio, the effective memory access time is 122ms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    in A Paging System, It Takes 30 Ns To Search Translation Lookaside Buffer (TLB) and

    Uploaded by

    Mahmoud Abdel-Salam
    32 views1 page
    The document describes two scenarios involving translation lookaside buffers (TLBs) and their impact on effective memory access times. In the first scenario, with a 30ns TLB search time, 90ns memory access time, and 70% TLB hit ratio, the effective memory access time is 120ns. In the second scenario, with a 10ms TLB search time, 80ms memory access time, and 60% TLB hit ratio, the effective memory access time is 122ms.

    Original Title

    EX

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes two scenarios involving translation lookaside buffers (TLBs) and their impact on effective memory access times. In the first scenario, with a 30ns TLB search time, 90ns memory access time, and 70% TLB hit ratio, the effective memory access time is 120ns. In the second scenario, with a 10ms TLB search time, 80ms memory access time, and 60% TLB hit ratio, the effective memory access time is 122ms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    32 views1 page

    in A Paging System, It Takes 30 Ns To Search Translation Lookaside Buffer (TLB) and

    Uploaded by

    Mahmoud Abdel-Salam
    The document describes two scenarios involving translation lookaside buffers (TLBs) and their impact on effective memory access times. In the first scenario, with a 30ns TLB search time, 90ns memory access time, and 70% TLB hit ratio, the effective memory access time is 120ns. In the second scenario, with a 10ms TLB search time, 80ms memory access time, and 60% TLB hit ratio, the effective memory access time is 122ms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    1.

    In a paging system, it takes 30 ns to search translation Lookaside Buffer (TLB) and


    90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory
    access time is :
    A 48ns
    B 147ns
    C 120ns
    D 84ns

    2. Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are
    in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access
    the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in
    milliseconds) is _________.

    A 120
    B 122
    C 124
    D 118

    You might also like