1,629 views

2 Answers

0 votes
0 votes
$\underline{\textbf{Answer:}\Rightarrow}$

$\underline{\textbf{Explanation:}\Rightarrow}$

Assume $\mathbf k$ instructions:

$\mathbf{k-1}$ instructions execution without page fault $ = 1 \times (\mathrm k-1) \;\text{nsec}$

$1$ instruction with page fault $ = (1+n) \times 1\;\text{nsec}$

$\therefore $ Average is given by the formula $ = {(1\times (\mathrm k-1) + 10 +n) \times 1)}{k}\; \mathbf{ =1 + \dfrac{n}{k} \;\text{nsec}}$
edited by
0 votes
0 votes

Answer:

Assume k instructions:

k−1 instructions execution without page fault =(k−1)nsec

1 instruction with page fault =(1+n)nsec

∴Average is given by the formula =(k−1+1+n) / k=1+n/nsec

Related questions

0 votes
0 votes
0 answers
4
admin asked Oct 26, 2019
305 views
A machine-language instruction to load a $32-bit$ word into a register contains the $32-bit$ address of the word to be loaded. What is the maximum number of page faults t...