'Virtual addressing page table if we use 32-bit, 64-bit, and 128-bit
Hi i'm having a little bit of trouble here concerning a exercice.
Calculate the number of entries in a page table if we use 32-bit, 64-bit, and 128-bit virtual addressing respectively and the size of a page is 4 KB.
Considering that 2^12 = 4Ko
32 - 12 = 20 then it will be 2^20
How can I apply this for a virtual addressing of 64 bits and 128 bits ?
Thank you :)
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|
