recategorized by
19,918 views
47 votes
47 votes

If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is:

  1. $i + \dfrac{j}{k}$

  2. $i +(j\times k)$

  3. $\dfrac{i+j}{k}$

  4. $({i+j})\times {k}$

recategorized by

9 Answers

Best answer
61 votes
61 votes

Page fault rate $=\dfrac{1}{k}$
Page hit rate $=1-\dfrac{1}{k}$
Service time $=i$
Page fault service time $= i+j$

Effective memory access time,

$\quad =\dfrac{1}{k}\times (i+j)+\left(1-\dfrac{1}{k}\right)\times i$

$\quad=\dfrac{(i+j)}{k}+i-\dfrac{i}{k}$

$\quad=\dfrac{i}{k}+\dfrac{j}{k}+i-\dfrac{i}{k}$

$\quad=i+\dfrac{j}{k}$

So, option (A) is correct.

edited by
20 votes
20 votes

Lets take a example

no of instruction =6

i=4(Normal instrction execution time)

j=2(Additional time incase of page fault)

k=3(Page fault occurs on every kth instruction)

Total time required=4+4+(4+2)+4+4+(4+2)=28

Average time=28/6=4.66

Now substitute the i,j,k values in options 

i+j/k=4+2/4=4.66

so A is the answer

16 votes
16 votes
Here, given that On an average page fault occurs at every 'k' seconds. So, probability of getting a page fault is (1/k).

 

Effective Instruction Time = Normal instruction execution Time + Average Page Fault Service Time

i.e. Avg Page Fault Service Time = prob. of getting page fault * page fault service time =(1/k )* j

 

so its "i + (1/k)*j".
5 votes
5 votes
One more way could be. Let us we have 100 instruction then page fault will occur 100/k times. So

Total execution time  = 100*i +  (100/k)*j

So avg execution time  = (Total execution time)/(Total number of instruction) = i + (j/k).

 

Answer is (A) Part.
Answer:

Related questions

8.7k
views
2 answers
29 votes
Kathleen asked Sep 14, 2014
8,734 views
Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition ... dependency preservingdependency preserving but not lossless joinnot dependency preserving and not lossless join
27.1k
views
6 answers
66 votes
Rucha Shelke asked Sep 26, 2014
27,100 views
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as ... for memory management is no longer neededCPU scheduling can be made more efficient now
11.5k
views
7 answers
43 votes
Ishrat Jahan asked Nov 3, 2014
11,545 views
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files ... mode in which the signal handling routine executes?User modeKernel modeSuperuser modePrivileged mode
23.1k
views
5 answers
89 votes
Kathleen asked Sep 25, 2014
23,141 views
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting ... \leq \frac{t-ns}{n+1}$q \geq \frac{t-ns}{n+1}$