TLB Entry: $\begin{array}{|l|l|} \hline \text{Page Number} & \text{Frame Number} \\ \hline \end{array}$
Memory is $\text{word addressable.}$
- Word size $= 4 \text{ Bytes} $
- Page size $ = 8\;\text{KB} = 2^{11} \text{ words}$
- Virtual Memory size $= 2^{64} \text{ words}$
- Number of pages possible $= 2^{53}$
- Number of bits required for Page number $= 53 \text{ bits}$
- Number of bits required for Page offset $= 64-53 =11 \text{ bits}$
At a time TLB contains $128=2^{7} $ distinct page numbers.
If a page number is found in TLB then there will be a hit for all the words (Word addresses) of that Page.
$1$ - page hit implies $2^{11}$ distinct virtual address hits.
So $2^{7} $page hit implies $2^7 \ast 2^{11} = 2^8\ast 2^{10} = 256 \ast 2^{10} \text{ virtual address hits}$
Option B. At most, $256 \ast 2^{10}$ distinct virtual addresses can be translated without any TLB miss.