Anonymous user
Paging: Difference between revisions
MMU Article 1 and Article 2 merged
| [unchecked revision] | [unchecked revision] |
m (Rearranged a few sentences in the beginning and fixed some typos.) |
(MMU Article 1 and Article 2 merged) |
||
Line 9:
== MMU ==
Paging is achieved through the use of the
Both tables contain 1024 4-byte entries, making them 4 KiB each. In the page directory, each entry points to a page table. In the page table, each entry points to a physical address that is then mapped to the virtual address found by calculating the offset within the directory and the offset within the table. This can be done as the entire table system represents a linear 4-GiB virtual memory map.
| |||