Affiliation:
1. Rutgers University, Piscataway, NJ, USA
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.
Funder
Google
VMWare
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Orchestrated Scheduling and Partitioning for Improved Address Translation in GPUs;2023 60th ACM/IEEE Design Automation Conference (DAC);2023-07-09
2. Effective TLB thrashing;Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing;2022-04-25
3. Pinning Page Structure Entries to Last-Level Cache for Fast Address Translation;IEEE Access;2022
4. Neighborhood-Aware Address Translation for Irregular GPU Applications;2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO);2018-10
5. Scheduling Page Table Walks for Irregular GPU Applications;2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA);2018-06