
We begin by applying recently proposed predictive cache replacement policies to the TLB. We show these policies do not work well without considering specific TLB behavior. Next, we introduce a novel TLB-focused predictive policy, Control-flow History Reuse Prediction (CHiRP). This policy uses a history signature and replacement algorithm that correlates to known TLB behavior, outperforming other policies. For a 1024-entry 8-way set-associative L2 TLB with a 4KB page size, we show that CHIRP reduces misses per 1000 instructions (MPKI) by an average 28.21% over the least-recently- used (LRU) policy, outperforming Static Re-reference Interval Prediction (SRRIP), Global History Reuse Policy (GHRP) and SHiP, which reduce MPKI by an average of 10.36%, 9.03% and 0.88%, respectively. [an error occurred while processing this directive] Elba Garza is a fifth-year CSCE PhD student working under Daniel A. Jiménez at Texas A∓M University. Her work focuses on making hardware predictive structures ∓ policies (e.g. branch prediction, prefetching, cache replacement) more effective and resilient to evolving computing demands, and has been published in top tier computer architecture conferences. After graduation, she hopes to enter academia in a teaching-focused professorial position. [an error occurred while processing this directive] Personal home page [an error occurred while processing this directive] [an error occurred while processing this directive]