in Operating System recategorized by
357 views
1 vote
1 vote
Assume that in a certain computer, the virtual addresses are $64$-bit long, the physical addresses are $48$-bit long, and the memory is word-addressable. The page size is $16 \mathrm{KB}$ and the word size is $8 \mathrm{B}$. Transalation Look-aside Buffer $\text{(TLB)}$ in the address transalation path has $256$ valid entries. At most how many distinct virtual addresses can be translated without any $\text{TLB}$ miss?
in Operating System recategorized by
by
357 views

1 Answer

1 vote
1 vote

As memory is word-addressable hence page size = $16$$KB$ / $8$$B$ = $2$$K$ words

hence each page contains $2K$ unique addresses,

now TLB entries  = $256$, 

so, total number distinct virtual addresses that can be translated without any TLB miss = $256$ $*$ $2K$ = $512K$ =$2^{19}$

Similar question : https://gateoverflow.in/302815/gate-cse-2019-question-33

Related questions