reshown by
1,179 views
3 votes
3 votes

To calculate EMAT in case of page fault we used:

EMAT= page fault rate*(page fault service time)  + (1-page fault rate)*(memory access time)

My doubt is:

In case of NO PAGE FAULT, why we considered only one memory access time .

Why not two memory accesses, one for page table + one for accessing actual byte. ?

That is:

Why not this formula:

EMAT= page fault rate*(page fault service time)  + (1-page fault rate)* (2 * memory access time)

@arjun sir 

https://gateoverflow.in/318/gate2004-47

Here, in TLB + Page Fault type question,

You considered (VA -> PA time) + memory access time.

 

Then why not we consider address translation time in questions involving only pagefault?

 

reshown by

1 Answer

1 votes
1 votes

This GATE question is similar to your doubt :

https://gateoverflow.in/669/gate2000-2-22

Now, see when only the page fault rate given in the question then we consider that the TLB hit ratio is 100% and we will assume that TLB access time is negligible.

This is Arjun sir Comment on the same question: https://gateoverflow.in/669/gate2000-2-22?show=5230#c5230

Now, this thing arise a question: Is TLB hit lead to the page fault? that answer also you will get in the same comment of Arjun sir.

Related questions

2.8k
views
1 answers
2 votes
Akash Kumar Roy asked Apr 5, 2018
2,770 views
First read this whole thing what I am writing below:Case 1: If we have to access unit address in memory using TLB and we assume that no page ... EMAT here affects the first Estimated memory access time which we have calculated using TLB?
331
views
1 answers
0 votes
AnilGoudar asked Apr 30, 2017
331 views
Small doubt,We know that, when a page fault(required page is missing in main memory) occurs, the respective process will be blocked (Process is removed from ... removed once a process is blocked). Is my understanding correct? Please help me
5.1k
views
1 answers
0 votes
akash.dinkar12 asked Mar 21, 2019
5,116 views
Consider the following page reference string:$7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.$Assuming demand ... following replacement algorithms ?$ $ $LRU$ $replacement$ $ $FIFO$ $replacement$ $ $Optimal$ $replacement$
921
views
0 answers
1 votes
akash.dinkar12 asked Mar 21, 2019
921 views
When a page fault occurs, the process requesting the page must block while waiting for the page to be brought from disk into physical memory. Assume that there ... also have to wait for the faulting page to be brought into memory? Explain.