Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
The TLB has 128 valid entries, each translating one **page**. A page has $8\text{ kB}=2^{13}$ bytes, and a word is 4 bytes, so the memory is word-addressable with $2^{13}/4=2^{11}$ words (virtual addresses) per page.
Distinct virtual addresses translatable without a miss $=128\times2^{11}=2^7\times2^{11}=2^{18}=256\times2^{10}$.
Option (B).
More Memory Interfacing and Hierarchy questions
GATE 2019 CS Q55– A certain processor deploys a single-level cache. The cache block size is 8 words and the…
GATE 2018 CS Q33– A 32-bit wide main memory unit with a capacity of 1 GB is built using 256M 4-bit DRAM…
GATE 2018 CS Q44– The size of the physical address space of a processor is 2P bytes. The word length is 2W…
GATE 2016 CS (CS1) Q19– A processor can support a maximum memory of 4 GB, where the memory is word-addressable (a…
GATE 2017 CS (CS1) Q35– Consider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4…
GATE 2017 CS (CS1) Q61– Consider a 2-way set associative cache with 256 blocks and uses LRU replacement. Initially…