Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    78.EMAT Formulas

    Uploaded by

    nobitanobi0411
    This document provides 11 formulas for calculating expected memory access time (EMAT) given different memory hierarchy configurations including cache, TLB, main memory and paging. It defines terms like page hit ratio, page fault ratio, dirty page ratio and explains the steps involved in memory access for different cases.

    Copyright:

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

    78.EMAT Formulas

    Uploaded by

    nobitanobi0411
    27 views4 pages
    This document provides 11 formulas for calculating expected memory access time (EMAT) given different memory hierarchy configurations including cache, TLB, main memory and paging. It defines terms like page hit ratio, page fault ratio, dirty page ratio and explains the steps involved in memory access for different cases.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides 11 formulas for calculating expected memory access time (EMAT) given different memory hierarchy configurations including cache, TLB, main memory and paging. It defines terms like page hit ratio, page fault ratio, dirty page ratio and explains the steps involved in memory access for different cases.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views4 pages

    78.EMAT Formulas

    Uploaded by

    nobitanobi0411
    This document provides 11 formulas for calculating expected memory access time (EMAT) given different memory hierarchy configurations including cache, TLB, main memory and paging. It defines terms like page hit ratio, page fault ratio, dirty page ratio and explains the steps involved in memory access for different cases.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Ravindrababu Ravula ​www.ravindrababuravula.

    com Ravindrababu Ravula

    [Updated: 11/Sep/2020]

    NOTE :
    1) We have considered average access time between the cache and the main
    memory, by default. However, one can consider the access time per instruction as
    well. This depends on the question and the assumptions made in the question.
    2) Here, we have assumed no cache updation mechanism (i.e, a cache miss will lead
    to main memory access, no updation of cache is involved). In the GATE Exam, it is
    recommended that the students should read the question carefully, and note
    down the assumptions made in the question, and derive the formula accordingly.
    3) We have also assumed that TLB hit implies no page fault.
    4) Memorizing these formulas is highly discouraged.

    Calculate EMAT given the following scenarios:

    1.
    K-level paging, tlb, main memory.
    M = memory access time
    t = tlb access time
    h = tlb hit ratio, (1 - h) = tlb miss ratio
    K = no. of page table levels

    EMAT = h(t + M) + (1 - h) [KM + M + t]

    (1) Search TLB for address

    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula


    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula

    (2) Address found in TLB (TLB hit)


    (3) Fetch the page, memory access (M)
    (4) TLB miss, resolve address (VA→PA), for K-level, KM accesses
    (5) Step3: Fetch the page, Memory access (M)

    2.
    K-level paging, TLB, Main memory, page fault, Disk access given

    P = Page fault rate, (1 - P) = Page hit rate


    D = Disk access time

    EMAT = h(t + M) + (1 - h) [t + KM + (1-P)(M) + P(M+D)]


    Case(1) Given page is dirty with probability (d)
    EMAT = h(t+M) + (1-h) [t + KM + (1-P)(M) + P[(1-d)(M+D) + d(M+2D)]]

    3.
    K-level paging, TLB, Main memory, Page fault, Page fault service time given (PFST)
    EMAT = h(t+M) + (1-h)[t + KM + (1-P)(M) + P(PFST)]

    4.
    TLB, Cache, Main memory, K-level paging.

    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula


    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula

    Assume page tables are not cached.

    C = cache access time


    a = cache hit ratio, (1-a) = cache miss ratio

    EMAT = h[t + aC + (1-a)(M)] + (1-h)[t + KM + aC + (1-a)M]


    Let T​c​ = aC + (1-a)M
    EMAT = h(t + T​c​) + (1-h)[t + KM + T​c​]

    5.
    TLB, Cache, Main memory, K-level paging, Page fault, Disk access.
    EMAT = h(t+T​c​) + (1-h)[t + KM + (1-P)(T​c​) + P(M+D)]

    6.
    TLB, Cache, Main memory, K-levels, Page fault, PFST.
    EMAT = h(t+T​c​) + (1-h)[t + KM + (1-P)(T​c​) + P(PFST)]

    7.
    Case 5, with dirty (d)
    EMAT = h(t+T​c​) + (1-h)[t + KM + (1-P)(T​c​) + P[(1-d)(M+D) + d(M+2D)]]

    From now on assume page tables are also cached.

    8.
    TLB, Cache, Main memory, K-level
    EMAT = h[t+T​c​] + (1-h)[t + KT​c​ + T​c​]

    9.
    TLB, Cache, Main memory, K-level, Page fault, Disk access
    EMAT = h[t+T​c​] + (1-h)[t + KT​c​ + (1-P)(T​c​) + P(M+D)]

    10.
    TLB, Cache, Main memory, K-levels, Page fault, PSFT
    EMAT = h[t+T​c​] + (1-h)[t + KT​c​ + (1-P)T​c​ + P(PFST)]

    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula


    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula

    11.
    Case 9, with Page dirty
    EMAT = h[t+T​c​] + (1-h)[t + KT​c​ + (1-P)T​c​ + P[(1-d)(M+D) + d(M+2D)]]

    Note: T​c​ = aC + (1-a)M = average access time between Memory & Cache. We assume that on
    cache miss, the page is fetched from main memory, and the cache update time is negligible.
    Similarly, in the case of page fault and TLB miss.

    ****************************************************************************************************

    Ravindrababu Ravula ​www.ravindrababuravula.com Ravindrababu Ravula

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy