• edited by
2,604 views
1 1 vote

Given 64 bit logical space, Page Size = $4KB$. Do the three level paging? 

My Solution:-

1. Since address space is =$ 2^{64} Bytes$

     Page size = $2^{12}$ Bytes.

     Number of entries in third level Page table is :- $2^{64} / 2^{12}$ = $2^{52}$.

     Size of third level Page table = $2^{52} * 4B = 2^{54}$.

 

Number of entries in second level page table is = $2^{54} / 2^{12} = 2^{42}$. Size of second level page table = $2^{44}$.

Likewise in last level = $2^{44} / 2^{12} = 2^{32}$.

Size of 1st level page table = $2^{34}$.

 

It's correct right ?

Doubt :- They write corresponding bits for indexing page tables at three levels as:-

$1st$ level  $2nd$ level $3rd$ level Offset
       $ 32$        $10$       $10$      $12$

Please explain how did they find this out ?

Please :)

1 Answer

0 0 votes
No of bits to index page table is =Page size/PTE size

for last page table (it may or may not fit in single frame so)=page table size/Pte size
Position:
Show:

Related questions

1 1 vote
2 2 answers
989
989 views
!KARAN asked May 18, 2019
989 views
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
0 0 votes
1 1 answer
846
846 views
dd asked Sep 13, 2018
846 views
A page table based translation will always consume less memory to store translation meta-data, than a seg-mentation based solution. True/False. Explain.
1 1 vote
0 0 answers
2.4k
2.4k views
Harsh Kumar asked Aug 12, 2018
2,437 views
I have watched two video lectures on OS memory management (PK Biswas and IISc Mathew Jacob). In both lectures they say that the compiler assumes (while compiling and gene...
0 0 votes
0 0 answers
1.1k
1.1k views
srestha asked Jul 26, 2018
1,088 views
Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the s...