recategorized by
19,931 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

2 votes
2 votes
1 instruction takes i ms.

k instructions will take k*i ms.

1 page fault in every k instructions. Page Fault Service Time is j ms.

So,

Total time required to execute k instructions is (k*i+j) ms.

 

so here ,

Effective instruction time = (k*i+j)/k

i.e, i + j/k
0 votes
0 votes

In this question, a page fault occurring every k instructions. So that means we need to manage a page fault after every k instructions. Now we write this expression by this information,

                                                        k* EIT = k*i + j

                                                           EIT = i + j/k                                    , where EIT = Effective instruction time

 

Correct Answer : Option A

Answer:

Related questions

8.7k
views
2 answers
29 votes
Kathleen asked Sep 14, 2014
8,743 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,112 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,549 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.2k
views
5 answers
89 votes
Kathleen asked Sep 25, 2014
23,157 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}$