Scott Tetrick

Scott Tetrick

Auto-generated profile, based on publicly available information

Scott Tetrick

Ampere Computing, Santa Clara, CA, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2024 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
EAErika S. Alcorta
Erika S. Alcorta
MMMahesh Madhav
Mahesh Madhav
RARichard Afoakwa
Richard Afoakwa
STScott Tetrick
Scott Tetrick
NYNeeraja J. Yadwadkar
Neeraja J. Yadwadkar
AGAndreas Gerstlauer
Andreas Gerstlauer
Modern computer designs support composite prefetching, where multiple prefetcher components are used to target different memory access patterns. However, multiple prefetchers competing for resources can sometimes hurt performance, especially in many-core systems where cache and other resources are limited. Recent work has proposed mitigating this issue by selectively enabling and disabling prefetcher components at runtime. Formulating the problem with machine learning (ML) methods is promising, but efficient and effective solutions in terms of cost and performance are not well understood. This work studies fundamental characteristics of the composite prefetcher selection problem through the lens of ML to inform future prefetcher selection designs. We show that prefetcher decisions do not have significant temporal dependencies, that a phase-based rather than sample-based definition of ground truth yields patterns that are easier to learn, and that prefetcher selection can be formulated as a workload-agnostic problem requiring little to no training at runtime.