因此，页表的大小就很重要。
页表的数量与虚拟地址空间的大小成比例。
The number of page table entries is proportional to the size of virtual address space.
在高端内存中存储页表条目。
另一种选择是通过减少页表中的条目来减少页表的大小。
Another option is to decrease page table size by reducing page table entries.
全局分区页表由不同分区的pmb到lmb的映射组成。
The global partition page table consists of the mapping of PMBs to the LMBs of different partitions.
建立一个页表，把逻辑地址转换为物理地址。
Set up a page table to translate logical to physical addresses.
当页表变得非常大时，被分割的调页是有用的。
Segmented paging is helpful when the page table becomes very large.
每个进程有着属于自己的页表，不过进程也不能随心所欲。
Each process has its own set of page tables, but there is a catch.
最简单的分页表经常是维护一个帧表和一个页表。
The simplest page table systems often maintain a frame table and a page table.
作为代价，使用这些页表条目的进程会稍微慢一些。
In exchange, the process of using these page-table entries is somewhat slower.
第一步转换的表称为页目录，第二步的表称为页表。
The first translation table is called the Page Directory, and the second is called the Page table.
能允许的操作须指定使用与每个页表入口关联的控制位。
Permitted operations are specified using control bits associated with each page table entry.
为了能同时对虚拟地址空间和它对应的页表都进行分页。
So we can page the virtual address space AND page the page table.
表1(在图7中)显示了基于最大分区内存值来分配的页表空间大小。
Table 1 (in Figure 7) shows the size of the page table space allocated based on the maximum partition memory value.
处理器通过观察存储页表(由存储器核心维持)来决定存储区域的类型。
The processor determines the type of a given memory region mainly by looking at page tables, which are maintained by the kernel.
虚拟内存到物理内存的映射通过页表完成，这是在底层软件中实现的(见图1)。
The mapping of virtual memory to physical memory occurs through page tables, which are implemented in the underlying hardware (see Figure 1).
Hypervisor使用全局分区页表将虚拟地址转换为系统范围的物理地址。
The hypervisor converts a virtual address to a system-wide physical address using the global partition page tables.
页表的大小与页面大小成反比，这意味着页面大小越小，页表就越大，开销也就越大。
The size of the page table is inversely proportional to the page size, which implies that the smaller the page size, the larger the page table, and hence more overhead.
锁定TLB输入能确保对于给出区域的内存读取绝不会导致页表移动的掉失。
Locking TLB entries can ensure that a memory access to a given region never incurs the penalty of a page table walk.
由于每个页都要由每个进程映射，必须创建页表条目来将虚拟地址映射到物理地址。
For every page mapped by each process, page-table entries must also be created to map the virtual address to the physical address.
寻址的页不在内存中，对应的页表条目是空的，或者是违背了页式管理的保护机制。
The addressed page is not present in memory, the corresponding page Table entry is null, or a violation of the paging protection mechanism has occurred.
为了找到指定虚拟地址所对应的物理地址，必须定位于合适的页表及其中正确的入口。
To determine the physical address corresponding to a given virtual address, the appropriate page table, and the correct entry within that page table must be located.
Hypervisor可以访问整个内存空间，并且通过全局分区页表来维护分配给分区的内存。
The hypervisor has access to the entire memory space, and maintains the memory allocated to partitions through a global partition page table.
对于每个正在运行的进程，虚拟地址与物理地址之间的映射是在一个称作页表的数据结构中维护的。
For each running process, the mapping between virtual and physical address is maintained in a data structure called the page table.
如果TLB没有命中，那么就需要访问存储在主存中的页表，而这样做需要消耗相当多的处理器周期。
A TLB miss requires accessing a page table that is stored in the main memory, which consumes considerably more processor cycles.
POWER5 +处理器架构(运行AIX 5l操作系统)通过引入多页面大小来解决页表问题。
The POWER5 + processor architecture (running the AIX 5l operating system) addresses the page table problem by introducing multiple page sizes.
在Linux内存管理器中，页表保持对进程使用的内存物理页的追踪，它们将虚拟页映射到物理页。
In the Linux memory manager, page tables keep track of the physical pages of memory that are used by a process, and they map the virtual pages to the physical pages.
由于大部分进程的虚拟地址空间大而散，页表入口只能定位在实际使用的那部分地址空间上。
Because the virtual address Spaces of most processes are both large and sparse, page table entries are only allocated for the portions of the address space that are actually used.
在这种情况下，每个映射到同一块1GB内存的进程将为页表条目付出自己2MB的代价。
In such a situation, every process mapping that same 1 GB of memory would consume its own 2 MB worth of page-table entries.
在这种情况下，每个映射到同一块1GB内存的进程将为页表条目付出自己2MB的代价。
In such a situation, every process mapping that same 1 GB of memory would consume its own 2 MB worth of page-table entries.
应用推荐