頁表條目 的英文怎麼說
中文拼音 [yèbiǎotiáomù]
頁表條目
英文
pte-
If the page being looked for has been swapped out, a swap entry is stored at in the pte table which is used when there is a page fault for finding the page frame to reload in memory
如果正在查找的頁已轉出,那麼就會在pte表中存儲一個交換條目, (在缺頁的情況下)以定位將哪個頁框重新加載到內存中。Storing page - table entries in high memory
在高端內存中存儲頁表條目Instead of traversing the page tables for every process, the memory manager now has, for each physical page, a linked list containing pointers to the page - table entries ptes of every process currently mapping that page
不再是遍歷每個進程的頁表,內存管理器現在為每一個物理頁建立了一個鏈表,包含了指向當前映射那個頁的每一個進程的頁表條目( page - table entries , pte )的指針。Please click the following hyperlinks for details of prescribed forms and exempted provisions under respective ordinance. )
(瀏覽條例規定表格的目錄及獲豁免的條款可連結到以下相關網頁)In the 2. 6 kernel now allows the page - table entries to be placed in high memory, freeing more of the low memory area for other kernel data structures that do have to be placed there
,讓頁表條目可以存放在高端內存中,釋放出更多的低端內存區域給那些必須放在這里的其他內核數據結構。This article outlines a few of the more important changes, including reverse mapping, the use of larger memory pages, storage of page - table entries in high memory, and greater stability of the memory manager
本文列出了一些更重要的改變,包括反向映射( reverse mapping ) 、使用更大的內存頁、頁表條目存儲在高端內存中,以及更穩定的內存管理器。In exchange, the process of using these page - table entries is somewhat slower
作為代價,使用這些頁表條目的進程會稍微慢一些。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的開銷。Register. the directory field within the linear address determines the entry in page directory that points to the proper page table
寄存器中。線性地址中的directory欄位確定頁目錄中指向恰當的頁表條目。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的代價。For every page mapped by each process, page - table entries must also be created to map the virtual address to the physical address
由於每個頁都要由每個進程映射,必須創建頁表條目來將虛擬地址映射到物理地址。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個頁表條目來保持對那些頁的追蹤。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個位元組來存儲指向鏈的下一個條目的指針。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個。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
不過,在它們可以被交換出去之前,必須找到映射那個頁的每一個進程,這樣那些進程中相應頁的頁表條目才可以被更新。分享友人