Pith. sign in

REVIEW 1 cited by

Lightweight ML-based Runtime Prefetcher Selection on Many-core Platforms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.08635 v1 pith:LDEAA4ER submitted 2023-07-17 cs.AR

classification cs.AR
keywords prefetchermany-coreproposedruntimecomponentscompositehoweverlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modern computer designs support composite prefetching, where multiple individual prefetcher components are used to target different memory access patterns. However, multiple prefetchers competing for resources can drastically hurt performance, especially in many-core systems where cache and other resources are shared and very limited. Prior work has proposed mitigating this issue by selectively enabling and disabling prefetcher components during runtime. Traditional approaches proposed heuristics that are hard to scale with increasing core and prefetcher component counts. More recently, deep reinforcement learning was proposed. However, it is too expensive to deploy in real-world many-core systems. In this work, we propose a new phase-based methodology for training a lightweight supervised learning model to manage composite prefetchers at runtime. Our approach improves the performance of a state-of-the-art many-core system by up to 25% and by 2.7% on average over its default prefetcher configuration.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Static Policies: Dynamic Selection Among Modern Microarchitectural Policies

    cs.AR 2026-08 conditional novelty 7.0 of 10

    A binary runtime choice between two L1D prefetchers recovers most of the performance left by any fixed policy, with a small decision tree or bandit rule as the selector.

Pith tools