1,953 views
0 votes
0 votes
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits.The page table is divided into 512 pages each of size 1K.The memory access time is 100ns and the TLB access time 15ns .Page table entry size at 1st level is 2 Bytes and that at second level us 4 Bytes each.

What is the memory overhead of storing the top level page table along with the page of the second level page table for a process?

A)6KB

B)4KB

C)5KB

D)12KB

2 Answers

1 votes
1 votes

 <------------------LA=32------------->

9 bits (first level) 10 bits (Second level) 13bits (offset)

First level Page Table Size = 2^9 * 2B(page table entry size)  = 1KB

Second level Page Table Size = 2^10 *4B(page table entry size)  = 4KB

Total = 5KB

0 votes
0 votes
p1 p2 d
9 10 13

P1= number of pages in 2nd level page table

P2=number of bits required to represent page size of page table

d= bits required for frame offset

total size =2^9 *2 +2^10 *4 =1KB+4KB=  5KB

Related questions

1.4k
views
1 answers
0 votes
Markzuck asked Dec 22, 2018
1,437 views
for memory overhead in Multi level paging, for innermost table only 1 page size shall be counted na? and NOT the complete page table size?please explain the concept, thanks!
1.1k
views
1 answers
5 votes
habedo007 asked Aug 8, 2017
1,059 views
A computer has a 128-entry $L_1$ TLB, 1024-entry $L_2$ TLB, and uses page size of 4KB. A program reads a 1MB array, one byte at a time from start to end, 10 ... , find TLB hits and misses of both $L_1$ and $L_2$ TLB (array is page aligned).
1.6k
views
1 answers
4 votes
Chaitanya Kale asked Dec 3, 2022
1,588 views
The below question is from made easy test series:Consider a 32 bit virtual address as follows: 10 8 6 8 P1 ... $^{7}$ pages. I don't know what I am getting wrong. Please correct me.
782
views
1 answers
0 votes