GATE Computer Science (CS) 2019 Solved Papers

Question : 43 of 65

Marks: +1, -0

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?

$16 × 2^{10}$
$256 × 2^{10}$
$4 × 2^{20}$
$8 × 2^{20}$

Validate

Solution:

1 word = 4 bytes
Page size = 8 kB = 213 B
Number of words in 1 page

=\;{2^{13}}/{2^{2}}=2^{11}

TLB can hold 128 valid entries so, at most

128 × 2^{11}

memory address can be addressed without TLB miss.

128 × 2^{11}=256 × 2^{10}

Go to Question:

Prev Question

Next Question