782 views

2 Answers

2 votes
2 votes

In such question , we should continue finding the page table size till its size becomes same as that of page size.

So 1st level page table size = (Logical address space * page table entry size)/page size

                                        = 234 * 22 / 210 = 226 bytes which is again large and > 210 bytes(1 KB as given for a page size)

So in 2nd level page table size = 226 * 22 / 210 = 218 bytes

In 3rd level page table size   =   218 * 22 / 210 = 210 bytes = 1 kB

So it is at the 3rd  level of paging that we are getting the page table size = page size

Hence , no of page tables required = 3

0 votes
0 votes

The splitting for Physical address would be PA = 24|10

Now, #entries per page = 28     which means 8 bits are required for offset within each page of page table.

So, for 1st level paging, the splitting would be as follows:  PA = 16| 8| 10

For 2nd level, PA = 8| 8| 8| 10

So, for 3rd level, its 8.

So, 3 levels of paging + 10 bits for accesing each frame.

Related questions

0 votes
0 votes
0 answers
1
SSR17 asked Feb 8
211 views
we have 8 pages (each side 32B) to store in physical memory of 2^32 bits how many bits are required to identify each page , according to me 3 bits are required but that i...
0 votes
0 votes
2 answers
2
Unique_999 asked Aug 17, 2023
324 views
Can Any explain the relationship between The “ Word Size “ and “ Logical Address Space “
0 votes
0 votes
1 answer
3