Translation caching
Authors:
Open Access
- 19 June 2010
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 38 (3) , 48-59
Abstract
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page table. In particular, these caches accelerate the page table walk that occurs after a miss in the Translation Lookaside Buffer. This paper shows that the most effective MMU caches are translation caches, which store partial translations and allow the page walk hardware to skip one or more levels of the page table. In recent years, both AMD and Intel processors have implemented MMU caches. However, their implementations are quite different and represent distinct points in the design space. This paper introduces three new MMU cache structures that round out the design space and directly compares the effectiveness of all five organizations. This comparison shows that two of the newly introduced structures, both of which are translation cache variants, are better than existing structures in many situations. Finally, this paper contributes to the age-old discourse concerning the relative effectiveness of different page table organizations. Generally speaking, earlier studies concluded that organizations based on hashing, such as the inverted page table, outperformed organizations based upon radix trees for supporting large virtual address spaces. However, these studies did not take into account the possibility of caching page table entries from the higher levels of the radix tree. This paper shows that any of the five MMU cache structures will reduce radix tree page table DRAM accesses far below an inverted page table.Keywords
This publication has 9 references indexed in Scilit:
- Inter-core cooperative TLB for chip multiprocessors2010
- Investigating the TLB Behavior of High-end Scientific Applications on Commodity Microprocessors2008
- Accelerating two-dimensional page walks for virtualized systems2008
- SPEC CPU2006 benchmark descriptionsACM SIGARCH Computer Architecture News, 2006
- Recency-based TLB preloading2000
- A look at several memory management units, TLB-refill mechanisms, and page table organizations1998
- A new page table for 64-bit address spaces1995
- Surpassing the TLB performance of superpages with less operating system support1994
- Address space sparsity and fine granularity1994