Q. 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 addressible. 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?
(A) 16×210
(B) 256×210
(C) 4×220
(D) 8×220
Ans: 256×210
Number of words in a page
= Page size / word size
= 8 KB / 4 B
= 2 K
= 2 * 210
Since TLB can hold 128 valid entries, therefore, TLB can translate
= 128 * number of words in page
= 128 * 2 * 210
= 256 * 210 addresses with TLB hit
So, option (D) is correct.