BarTLB: Barren page resistant TLB for managed runtime languages

ICCD(2014)

Cited 4|Views9
No score
Abstract
This work observes that many translation lookaside buffer (TLB) misses in Java workloads originate from barren pages. That is, pages that contain mostly dead objects sprinkled with only a few live objects. Barren pages experience only a few accesses every time they are touched thrashing a conventional TLB. This work characterizes the barren page phenomenon and proposes (1) a low-cost barren page identification technique, and (2) two simple, low-cost techniques for improving TLB performance: (a) The Barren Page First (BPF) replacement policy extends an existing TLB replacement policy to prefer barren pages on evictions. (b) Selective In-Cache Translation Caching (SICTC) avoids installing barren pages in the TLB by augmenting one way of a virtually-indexed, physically-tagged L1 data cache with virtual tags. For all workloads considered BPF and SICTC not only prove robust but also improve performance by 1.7% and 5.1% on average and by up to 4.6% and 12.0% respectively.
More
Translated text
Key words
sictc,cache storage,barren page first replacement policy,l1 data cache,storage allocation,tlb replacement policy,virtual tags,java workloads,barren page phenomenon,managed runtime languages,paged storage,low-cost barren page identification technique,selective in-cache translation caching,bpf replacement policy,translation lookaside buffer
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined