| 1. | Storing page - table entries in high memory
在高端内存中存储页表条目 |
| 2. | In exchange , the process of using these page - table entries is somewhat slower
作为代价，使用这些页表条目的进程会稍微慢一些。 |
| 3. | If each page - table entry consumes 8 bytes , then that would be 2 mb of overhead for every 1 gb of memory mapped
如果每个页表条目消耗8个字节，那些每映射1 gb内存需要2 mb的开销。 |
| 4. | Register . the directory field within the linear address determines the entry in page directory that points to the proper page table
寄存器中。线性地址中的directory字段确定页目录中指向恰当的页表条目。 |
| 5. | In such a situation , every process mapping that same 1 gb of memory would consume its own 2 mb worth of page - table entries
在这种情况下，每个映射到同一块1 gb内存的进程将为页表条目付出自己2 mb的代价。 |
| 6. | For every page mapped by each process , page - table entries must also be created to map the virtual address to the physical address
由于每个页都要由每个进程映射，必须创建页表条目来将虚拟地址映射到物理地址。 |
| 7. | If you have a process that maps 1 gb of memory with 4 kb pages , it would take 262 , 144 page - table entries to keep track of those pages
如果您的一个进程要使用4kb的页来映射1 gb内存，这将用到262 , 144个页表条目来保持对那些页的追踪。 |
| 8. | Each entry in the pte chain uses 4 bytes to store a pointer to the page - table entry and an additional 4 bytes to store the pointer to the next entry on the chain
Pte链的每一个条目使用4个字节来存储指向页表条目的指针，用另外4个字节来存储指向链的下一个条目的指针。 |
| 9. | Assuming a large page size of 4 mb is used in the same example from above , that same 1 gb of memory could be mapped with only 256 page - table entries instead of 262 , 144
假定在前面的中使用页大小为4 mb的大内存页，同样1 gb内存只用256个页表条目就可以映射，而不需要262 , 144个。 |
| 10. | However , before they can be swapped out , every single process mapping that page must be found so that the page - table entry for the page in that process can be updated
不过，在它们可以被交换出去之前，必须找到映射那个页的每一个进程，这样那些进程中相应页的页表条目才可以被更新。 |
