Efficient Address Translation for Architectures with Multiple Page Sizes
Authors:
Open Access
- 4 April 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 435-448
Abstract
Processors and operating systems (OSes) support multiple memory page sizes. Superpages increase Translation Lookaside Buffer (TLB) hits, while small pages provide fine-grained memory protection. Ideally, TLBs should perform well for any distribution of page sizes. In reality, set-associative TLBs -- used frequently for their energy efficiency compared to fully-associative TLBs -- cannot (easily) support multiple page sizes concurrently. Instead, commercial systems typically implement separate set-associative TLBs for different page sizes. This means that when superpages are allocated aggressively, TLB misses may, counter intuitively, increase even if entries for small pages remain unused (and vice-versa). We invent MIX TLBs, energy-frugal set-associative structures that concurrently support all page sizes by exploiting superpage allocation patterns. MIX TLBs boost the performance (often by 10-30%) of big-memory applications on native CPUs, virtualized CPUs, and GPUs. MIX TLBs are simple and require no OS or program changes.Keywords
Funding Information
- VMware
- National Science Foundation (1337147, 1253700)
This publication has 37 references indexed in Scilit:
- Redundant memory mappings for fast access to large memories2015
- Address Translation for Throughput-Oriented AcceleratorsIEEE Micro, 2015
- Large-reach memory management unit caches2013
- Scalable address spaces using RCU balanced trees2012
- Clearing the clouds2012
- Accelerating two-dimensional page walks for virtualized systems2008
- Concurrent support of multiple page sizes on a skewed associative TLBIEEE Transactions on Computers, 2004
- Skewed associativity enhances performance predictability1995
- Surpassing the TLB performance of superpages with less operating system support1994
- Tradeoffs in supporting two page sizes1992