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.
Gaze into the pattern: characterizing spatial patterns with internal temporal correlations for hardware prefetching,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Beyond Static Policies: Dynamic Selection Among Modern Microarchitectural Policies
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.