|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n | Since a page
table will generally require several pages |
||||||||||||
| to be stored.
One solution is to organize page tables |
|||||||||||||
| into a
multilevel hierarchy |
|||||||||||||
| u | When 2 levels are used (ex: 386,
Pentium), the page number |
||||||||||||
| is split into two
numbers p1 and p2 |
|||||||||||||
| u | p1 indexes the
outer paged table (directory) in main memory |
||||||||||||
| who’s entries
points to a page containing page table entries |
|||||||||||||
| which is itself
indexed by p2. Page tables, other than the |
|||||||||||||
| directory, are
swapped in and out as needed |
|||||||||||||
