6,449 views
9 votes
9 votes

Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory?

  1. 21.4 ns
  2. 29.9 ns
  3. 23.5 ns
  4. 35.1 ns

5 Answers

Best answer
11 votes
11 votes

Answer is B

given that one page fault for every 10^6 memory access, so the probability of page fault is  p-> 1/106   

page fault service time is = 10ms-> 10 * 10 ns ( note : given options are in Nano seconds better if you convert this to nano seconds at first).

memory access time is = 20ns

effective access time would be = p * page fault service time + (1-p) * memory access time

=> 1/10^6 *10*10^6+(1-1/10^6)20=>30-1/10^6=> closer answer is 29.9 ns 

selected by
2 votes
2 votes

I think correct answer is 30 ns. Part (B) is more closer to it so it could be selected.

Explanation -> 

I am assuming memory  has hierarchical organization. In all cases (Fault or not)  page will be accessed form main memory. 

Notice - Page fault service time does not include memory access time. Please correct me if i am wrong.

(Refer -http://stackoverflow.com/questions/40027359/what-is-page-fault-service-time  and 

https://gateoverflow.in/2122/gate2011-20-ugcnet-june2013-ii-48?show=126742#c126742 )

Case 1(No Page Fault): -  20 ns.

Case 2(Page Fault): - (20 + 10*10^6) ns.

Effective memory access  time  = (1- (1/10^6))*(Case 1 time)  + (1/10^6)*(Case 2 time)  = 20 + 10  = 30 ns. 

edited by
Answer:

Related questions

8 votes
8 votes
3 answers
3
Arjun asked Jul 6, 2016
10,844 views
At a particular time of computation the value of a counting semaphore is 7. Then 20 $P$ operations and $x$ $V$ operations were completed on this semaphore. If the new val...
17 votes
17 votes
2 answers
4
go_editor asked Jul 6, 2016
9,140 views
For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling