User Crackca

User Crackca
Verification: Not Verified Yet
Member for: 1 year (since Oct 8, 2020)
Type: Registered user
Full name:
GATE Year:
GATE Rank:
GitHub Profile Link:
DBLP Link:
Following standard books?:
Home State:
Donate Me Link:
Messages from only those in my circle:

Activity by Crackca

Score: 5 points (ranked #499)
No. of Edits: 0
Posts: 0
Questions: 0
Answers: 1
Comments: 0
Voted on: 0 questions, 0 answers
Gave out: 0 up votes, 0 down votes
Received: 0 up votes, 0 down votes

Wall for Crackca

Please log in or register to post on this wall.
aaa 1 Dec 1, 2021
by aaa 1
EMAT=Effective memory access Time ....

EMAT=page fault rate(Service time+memory access Time) +hit rate(TLB hit(TLB access Time+memory acess Time)+TLB miss(TLB access Time+no. of page table*memory acess Time+ memory access Time)) ...
aaa 1 Dec 1, 2021
by aaa 1
TLB stands for Translation Lookaside Buffer. In Virtual memory systems, the cpu generates virtual memory addresses. But, the data is stored in actual physical memory i.e. we need to place a physical memory address on the memory bus to fetch the data from the memory circuitry...

 So, a special table is maintained by the operating system called the Page table. This table contains a mapping between the virtual addresses and physical addresses. So, every time a cpu generates a virtual address, the operating system page table has to be looked up to find the corresponding physical address. To speed this up, there is hardware support called the TLB. The TLB is a high speed cache of the page table i.e. contains recently accessed virtual to physical translations.....

 TLB hit ratio- A TLB hit is the no of times a virtual-to-physical address translation was already found in the TLB, instead of going all the way to the page table which is located in slower physical memory...

 TLB hit ratio is nothing but the ratio of TLB hits/Total no of queries into TLB. In the case that the page is found in the TLB (TLB hit) the total time would be the time of search in the TLB plus the time to access memory,

 so TLB_hit_time := TLB_search_time + memory_access_time In the case that the page is not found in the TLB (TLB miss) the total time would be the time to search the TLB (you don't find anything,

 but searched nontheless) plus the time to access memory to get the page table and frame, plus the time to access memory to get the data,

so TLB_miss_time := TLB_search_time + memory_access_time + memory_access_time But this is in individual cases, when you want to know an average measure of the TLB performance, you use the Effective Access Time,

 that is the weighted average of the previous measures

EAT := TLB_miss_time * (1- hit_ratio) + TLB_hit_time * hit_ratio....
aaa 1 Dec 1, 2021
by aaa 1
@@@ Page miss is not the same as page fault.

Miss means, the page that the CPU looking for is not present in TLB, but it will present in the page table this is called a miss.
Page fault means, when we use demand paging then the page for which CPU looking is not present inside MM then it is called a page fault.

Please verify someone....

However, if there is no match (called a TLB miss), the memory management unit, or the operating system TLB miss handler, will typically look up the address ...