Pith.

Hardware Architecture · arXiv:2611.10929 v2 · submitted 7 Nov 2026

Augur: An Online Learning-based Hardware Data Prefetcher using Reservoir Computing

Satvik Maurya, David Trilla, Swamit Tannu, Alper Buyuktosunoglu

The paper says

“Machine-learning-based hardware prefetchers can learn complex access patterns, but practical deployment demands online adaptation, low-latency inference, and modest hardware cost. We present Augur, a hardware delta prefetcher based on next-generation reservoir computing (NGRC) that meets all three requirements.”

more of the abstract

Augur formulates delta prediction as a history-based regression problem. It constructs a fixed-size reservoir from hashed delta features over a short context window and predicts the next delta using a single dot product. The model is updated online via one-step SGD and requires no offline pre-training, no per-benchmark tuning, and no floating-point arithmetic. Replacing the integer multiplications traditionally used to generate nonlinear reservoir features with bitwise AND operations removes all feature-generation multipliers with no loss in performance. Because Augur regresses a continuous delta, it needs no action set chosen offline for a fixed set of workloads. Augur pairs the reservoir with a simple Markov-based delta predictor for simple delta patterns, and with a selective issuance policy that filters and throttles wasteful prefetches; this policy accounts for about 40% of Augur's advantage and also improves Pythia. Evaluated on 169 traces spanning GAP, Ligra, PARSEC, SPEC CPU 2006, SPEC CPU 2017, and AI workloads, Augur outperforms the state-of-the-art ML-based delta prefetcher by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems, respectively, while achieving  2x higher prefetch accuracy and 37.8 percentage points fewer overpredictions. Augur is practical to implement at 33 KB storage, 0.32 sq. mm area, and 32.7 mW in 12 nm.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 10 Nov 2026 · of version 1 of the paper; version 2 is newer · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up. Augur is a solid, well-executed hardware prefetcher that makes a genuine engineering contribution—bitwise AND in place of multiplication for NGRC features—and backs it up with thorough evaluation. The gains over Pythia are modest but consistent, and the hardware numbers are credible. This line is wrong

1 major objection · 7 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the references say.

The paper says, at Abstract and Section I

The review did not quote this passage.

Pith says: Objection 1 of 1 · major

The abstract and introduction repeatedly claim 'no workload-specific tuning'. While the hyperparameters (history length k=16, number of tracked PCs=16, learning-rate schedule constants, usefulness threshold) are indeed fixed across all benchmarks, they were chosen based on experiments on the SPEC and GAP subsets.

more of objection 1

The paper acknowledges this in Section VI-H ('Defaults were set on SPEC and GAP and not tuned per benchmark'), and the subsequent sensitivity studies show that variations in these parameters cause only small performance differences. This is defensible, but to avoid any misreading the 'no tuning' claim should be qualified earlier (e.g., 'no per-benchmark tuning') and the subset used for selection should be stated in the abstract or introduction.

7 minor objections

The paper says, at Abstract

Pith says: minor objection 1 of 7

The sentence 'Because Augur regresses a continuous delta rather than classifying into a fixed action set, it can predict any delta in [-64, 63]' appears twice in the abstract (once as 'Because Augur regresses a continuous delta in [−64,63] , it needs no action set chosen offline for a fixed set of workloads' and again verbatim a few lines later). Remove the duplicate.

The paper says, at Section I

Pith says: minor objection 2 of 7

In the phrase 'we ask–can a hardware delta prefetcher retain', replace the en-dash with a colon or em-dash for readability (e.g., 'we ask: can a hardware delta prefetcher retain').

show 5 more

The paper says, at Section III-D-2

Pith says: minor objection 3 of 7

The sentence 'Same-PC accesses arrive a median 32–64 cycles apart (21% within 8), a delay the simulator does not model' is an important limitation. Since the simulator does not model this delay, the reported speedups may be slightly optimistic for workloads with tight same-PC spacing. Please add a brief discussion of the expected impact (e.g., a sensitivity experiment where the prediction is replayed with a modelled delay, or a qualitative argument).

The paper says, at Section VI-H, Table VII

Pith says: minor objection 4 of 7

The column labeled 'Late' in Table VII appears to show percentages, but the table header does not specify the unit. Clarify whether these are percentages of issued prefetches or of total useful prefetches.

The paper says, at Section VI-A

Pith says: minor objection 5 of 7

The claim 'Augur outperforms every other prefetcher for single and multi-core systems' (summary line) is supported for geomean across all suites, but on the GAP suite Berti achieves 1.78% higher speedup than Augur (single-core). The text already notes this, but the summary statement could be softened slightly to reflect that Augur is not uniformly best on every suite.

The paper says, at Section VI-C

Pith says: minor objection 6 of 7

The text reports 'Augur achieves a 67% speedup over Pythia for the llama2 workload' (relative speedup? 1.67×?). Use consistent notation: either '1.67× speedup' or '67% higher speedup'.

The paper says, at Conclusion

Pith says: minor objection 7 of 7

In the concluding sentence, 'Augur is able to outperform the state-of-the-art prefetcher Pythia by up to 5.3%' should clarify that this is the geomean across all suites, not the maximum across all benchmarks.

What would settle it

As a verification step, independently reproduce the single-core geomean speedup of Augur versus Pythia on the SPEC 2017 suite using the ChampSim DPC-4 infrastructure with identical trace sets and warmup lengths. If the observed difference deviates by more than 0.5 percentage points from the reported 1.37%, examine trace preparation and prefetcher configuration for discrepancies.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 10 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic agrees 35 s · 28,398 tokens read, 3,668 written
  3. Editor wrote the verdict above 14 s · 29,133 tokens read, 1,391 written
  4. Referee minor revision: 1 major objection, 7 minor 29 s · 28,675 tokens read, 3,053 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

Satvik, you should take a look at this one. It is the real deal: a hardware prefetcher that actually runs online, uses a next-generation reservoir computer with a clever bitwise-AND trick to drop the multipliers, and then validates the whole thing in a commercial 12 nm synthesis. The paper does what a good architecture paper should—identify a practical constraint (no offline training, low-latency, bounded storage) and show a design that meets it.

What is new: the application of NGRC to delta prefetching, and specifically the replacement of integer multiplications with bitwise AND for generating non-linear features. The reasoning for why AND is sufficient (hash-derived features, diagonal terms preserve non-linear coupling) is concrete. The tournament architecture with a Markov table is routine but the ablation shows the reservoir does the heavy lifting. The evaluation is a strength: 169 traces, three multi-core configs, sensitivity on history length and PC count, robustness to low bandwidth and small LLC. They synthesize the RTL and report 0.32mm² and 32.7mW in 12nm—numbers that look honest (they use synthesized logic, not SRAM compilers, and call that conservative). The coverage-vs-accuracy tradeoff is well explained and defended.

What I would flag: the speedups over Pythia are in the 3-5% range geomean. That is not transformative but it is consistent and the error bars are there. The paper acknowledges that decision latency is not modeled, same-PC accesses within a few cycles are a blind spot. Both are standard for ChampSim evaluations but worth noting. Hyperparameters were chosen on SPEC+GAP but the sensitivity studys show low sensitivty. The bitwise-AND trick is clever but the paper does a fair ablation showing it loses nothing vs multiplication.

Overall this is a competent, honest piece of work. It is not a paradigm shift but it is a believable step forward for online ML in microarchitecture. I would be happy to serve as a referee. The paper is ready for a conference. Recommend accept with minor comments asking them to confirm the filter eviction policy and to discuss the 26% late prefetch rate (Table VII) a bit more.

The strongest objection

The paper's central claims are well-supported by a thorough evaluation across 169 traces, multiple core configurations, and sensitivity/ablation studies. The reader's weakest assumption—that the two chosen features and hyperparameters generalize—is backed by robustness checks showing that variations in history length (4–64), PC count (8–128), and learning rate schedule induce at most ~2.6% performance change relative to Augur's baseline, and Augur consistently outperforms Pythia across those variations. Limitations such as unmodeled decision latency and hyperparameter initialization on a subset of benchmarks are acknowledged and are standard for ChampSim evaluations. I therefore find no load-bearing concern that would invalidate the ACCEPT verdict.

The paper addresses the weakest assumption—feature sufficiency and hyperparameter generalization—with explicit sensitivity studies (history length, PC count, learning rate, base degree, usefulness thresholds) showing robustness across broad ranges. The ablation quantifies the contribution of each component, and the hardware synthesis confirms practicality at 35 KB, 0.32 mm², and 32.7 mW. The advantage over Pythia (2.9–5.3% geomean speedup) is consistent across single-, four-, and eight-core configurations, multiple benchmark suites, and adverse system settings (limited DRAM bandwidth, small LLC). Limitations such as unmodeled decision latency and per-PC state initialization are acknowledged and do not undermine the central claims. No new concern beyond those already considered by the reader justifies a change in verdict.

The referee's report

If the results hold, Augur closes a long-standing gap between ML-based prefetching and practical hardware deployment. The paper demonstrates that an online-learned model with no offline pre-training and no workload-specific tuning can outperform a state-of-the-art RL-based prefetcher (Pythia) that required hundreds of offline simulations. The bitwise-AND substitution is an elegant microarchitectural optimization that materially reduces area while preserving prediction quality. The evaluation is unusually thorough: 169 traces across six workload families, single- and multi-core configurations, sensitivity studies on history length and PC count, ablation studies isolating the Markov predictor and the reservoir, and hardware synthesis. Limitations (unmodeled decision latency, same-PC access timing) are acknowledged. The work opens a credible path for deploying online ML in other speculative microarchitectural components.

Pith's reading of the paper (a machine's summary, not the authors')

Augur is a hardware data prefetcher that applies next-generation reservoir computing (NGRC) to predict the next cache-line delta for a given load instruction. The paper shows that NGRC—a compact nonlinear autoregressive model—can be adapted for on-chip deployment by replacing the integer multiplications traditionally used to generate nonlinear features with bitwise AND operations, eliminating 528 multipliers without loss in prediction accuracy. Augur trains entirely online via single-step stochastic gradient descent, requires no offline per-workload tuning, and uses only fixed-point integer arithmetic. Evaluated across 169 traces from six benchmark suites, Augur outperforms the state-of-the-art ML-based delta prefetcher Pythia by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems respectively, while achieving roughly double the prefetch accuracy and 37.8% fewer overpredictions. The design is synthesized in 12nm with 35KB storage, 0.32mm² area, and 32.7mW power, demonstrating that practical ML-based prefetchers can combine online learning, cheap inference, and bounded hardware cost.

What carries the argument. The central mechanism is next-generation reservoir computing (NGRC) modified for hardware efficiency. NGRC maintains a time-delayed context window of f=2 linear features (PC XOR delta and PC XOR signature) with history length k=16, yielding N=32 linear features. Degree-2 nonlinear features (528 of them) are generated by computing bitwise ANDs between pairs of linear features instead of integer multiplications. The concatenated reservoir vector (560 elements) is multiplied by a learned per-PC weight vector Wout (20-bit integers) in a dot product to produce the predicted next delta. Training uses the delta observed on the next demand access to compute an error, which drives a per-PC SGD update of Wout with an adaptive learning rate. The Markov predictor (256-entry direct-mapped table) handles simple delta patterns, and a tournament mechanism selects the higher-confidence prediction. A prefetch filter with usefulness counters, prefetch filter, and adaptive lookahead completes the design.

Core claim. The paper establishes that next-generation reservoir computing (NGRC) provides a machine-learning framework that satisfies all three constraints—online learning, low-latency inference, and modest hardware footprint—that have limited prior ML-based prefetchers. Augur formulates delta prediction as a regression problem: it constructs a fixed-size reservoir from hashed delta features (PC XOR delta and PC XOR signature) over a short context window (k=16), generates degree-2 nonlinear features via bitwise AND instead of multiplication, and predicts the next delta with a single dot product. The model updates online via one-step SGD with an adaptive learning rate, uses only integer arithmetic, and pairs the reservoir with a Markov predictor for trivial patterns. The key insight is that bitwise AND operations preserve the joint context encoded in hash-derived features while removing all feature-generation multipliers, making the design area- and power-efficient. Augur also employs multi-layered filtering and adaptive lookahead to suppress wasteful prefetches, converting lower coverage into higher accuracy and greater speedup, especially in bandwidth-constrained multi-core systems.

The premise it rests on. The paper assumes that the two chosen input features (PC XOR delta and PC XOR signature), together with degree-2 bitwise-AND nonlinearity and hyperparameters (e.g., history length 16, 16 tracked PCs, learning rate schedule), are sufficient to capture the access patterns across all evaluated workloads without per-benchmark tuning; the ablation studies support this but do not exhaust the design space.

If the paper is right (Pith's inferences, not the authors')

If Augur's approach is correct, future processor designs can replace heuristic delta prefetchers with online-learning ML models that adapt per-workload without offline training, potentially improving performance across a broader range of applications.

The bitwise-AND substitution for multiplication in NGRC could be adopted in other on-chip ML tasks (e.g., branch prediction, cache replacement) where hash-derived features are used, significantly reducing area and power.

Augur's preference for higher accuracy over higher coverage suggests a design principle: in bandwidth- and cache-constrained systems, selective prefetching with strong throttling can yield better net speedup than aggressive prefetching.

The paper's sensitivity studies show that reducing history length to 4 or tracked PCs to 8 still outperforms Pythia; this suggests that the reservoir's core strength lies in the nonlinear combination of just the two features, not in long histories. An independent team could verify whether even sparser feature sets (e.g., single feature with AND nonlinearity) suffice.

Augur's reliance on the Markov predictor for simple patterns is effective only on SPEC-class workloads; on GAP and Ligra the Markov predictor contributes little. This hints that workload-aware dynamic switching (e.g., detecting pattern regularity) could further reduce hardware.

The paper reports that Augur's advantage increases on longer simulations (e.g., GAP 9.0%→10.0%), consistent with online learning adapting better over time. A testable corollary: Augur should maintain its edge on very long-running HPC or server workloads where Pythia's fixed action set may degrade.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Machine-learning-based hardware prefetchers can learn complex access patterns, but practical deployment demands online adaptation, low-latency inference, and modest hardware cost. We present Augur, a hardware delta prefetcher based on next-generation reservoir computing (NGRC) that meets all three requirements. Augur formulates delta prediction as a history-based regression problem. It constructs a fixed-size reservoir from hashed delta features over a short context window and predicts the next delta using a single dot product. The model is updated online via one-step SGD and requires no offline pre-training, no per-benchmark tuning, and no floating-point arithmetic. Replacing the integer multiplications traditionally used to generate nonlinear reservoir features with bitwise AND operations removes all feature-generation multipliers with no loss in performance. Because Augur regresses a continuous delta, it needs no action set chosen offline for a fixed set of workloads. Augur pairs the reservoir with a simple Markov-based delta predictor for simple delta patterns, and with a selective issuance policy that filters and throttles wasteful prefetches; this policy accounts for about 40% of Augur's advantage and also improves Pythia. Evaluated on 169 traces spanning GAP, Ligra, PARSEC, SPEC CPU 2006, SPEC CPU 2017, and AI workloads, Augur outperforms the state-of-the-art ML-based delta prefetcher by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems, respectively, while achieving  2x higher prefetch accuracy and 37.8 percentage points fewer overpredictions. Augur is practical to implement at 33 KB storage, 0.32 sq. mm area, and 32.7 mW in 12 nm.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-10

The authors' main claim, as the classifier picked it out 0.83

“Evaluated on 169 traces spanning GAP, Ligra, PARSEC, SPEC CPU 2006, SPEC CPU 2017, and AI workloads, Augur outperforms the state-of-the-art ML-based delta prefetcher by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems, respectively, while achieving ~2x higher prefetch accuracy and 37.8% fewer overpredictions.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.12 · human participants 0.01 · controlled comparison 0.83 · randomized assignment 0.01 · states quantitative result 0.99 · compares with prior results 0.98 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Machine-learning-based hardware prefetchers can learn complex access patterns, but practical deployment demands online adaptation, low-latency inference, and modest hardware cost. background 0.96 0.06 0.03 asserted 0.99
We present Augur, a hardware delta prefetcher based on next-generation reservoir computing (NGRC) that meets all three requirements. contribution 1.00 0.92 0.47 asserted 1.00
Augur formulates delta prediction as a history-based regression problem. method 0.97 0.85 0.03 asserted 1.00
It constructs a fixed-size reservoir from hashed delta features over a short context window and predicts the next delta using a single dot product. method 1.00 0.91 0.05 asserted 1.00
The model is updated online via one-step SGD and requires no offline pre-training, no workload-specific tuning, and no floating-point arithmetic. method 0.92 0.86 0.08 asserted 1.00
A key technical insight makes this practical: replacing the integer multiplications traditionally used to generate nonlinear reservoir features with bitwise AND operations removes all feature-generation multipliers while preserving the joint context encoded in hash-derived features. method 0.85 0.91 0.07 asserted 1.00
Because Augur regresses a continuous delta rather than classifying into a fixed action set, it can predict any delta in [-64, 63]. method 0.91 0.84 0.05 asserted 1.00
Augur pairs the reservoir with a simple Markov-based delta predictor for simple delta patterns and employs multi-layered filtering and adaptive lookahead to suppress wasteful prefetches. method 0.97 0.89 0.05 asserted 1.00
Evaluated on 169 traces spanning GAP, Ligra, PARSEC, SPEC CPU 2006, SPEC CPU 2017, and AI workloads, Augur outperforms the state-of-the-art ML-based delta prefetcher by 2.9%, 4.5%, and 5.3% in geomean speedup on 1-, 4-, and 8-core systems, respectively, while achieving ~2x higher prefetch accuracy and 37.8% fewer overpredictions. result 1.00 0.97 0.57 asserted 1.00
Augur is practical to implement at 35 KB storage, 0.32 sq. mm area, and 32.7 mW in 12 nm. result 0.99 0.94 0.12 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.63

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-10: 1 request, 7,829 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (14)
Figure 1 of the paper
Figure 1. Coverage and overpredictions by Augur and Pythia for representative SPEC 2006/2017 workloads. Speedups over a no-prefetch baseline are annotated above the bars. cache pollution and wasted bandwidth is most acute. This paper makes three primary contributions: 1) We introduce next-generation reservoir computing (NGRC) as a machine learning framework for hardware data prefetch￾ing. NGRC naturally satisfies the constraints of online learning, low-latency inference, and bounded storage that have limited the practicality of prior ML-based prefetchers. 2) We present a key hardware optimizat
Figure 2 of the paper
Figure 2. Next-generation reservoir computing. C. Our goal and proposal Given the limitations of current ML-based prefetchers, our goal in this paper is to find a prefetcher that exploits the learning capabilities of machine learning algorithms without these limitations. An ideal prefetcher can – 1) Learn patterns online while instructions are being executed. 2) Require no workload-specific offline tuning. 3) Make timely and accurate prefetches. 4) Attain a high coverage. 5) Be implemented efficiently in hardware. We seek to find an ML-based prefetcher that achieves all of the above. In…
Figure 3 of the paper
Figure 3. Overview of Augur. this richer representation to the next value in the sequence. Intuitively, NGRC turns prediction into a compact nonlinear autoregression problem: the delay window provides memory, the nonlinear features provide expressiveness, and the readout learns which patterns in recent history matter for forecasting. For data prefetching, this is a natural fit because the next delta is often determined by short-range temporal context and interactions among a few recent accesses, which NGRC can model accurately without using the complex ML model. The key advantages of NGRC for…
Figure 4 of the paper
Figure 4. (a) Input features for Augur: P C ⊕ deltat and P C ⊕ signaturet (k = 4); (b) Pipelined view of Augur. the instantaneous delta, while P C ⊕ signaturet provides the reservoir with a history of local (per-PC) deltas. Hashing both with the PC ensures that control flow information is also included in the reservoir. Because P C ⊕ signaturet already encodes a rolling history of recent strides, the context window length k can be kept small without sacrificing sequential context. Using two features also ensures that the linear and non-linear features generated do not scale unsustainably:…
Figure 5 of the paper
Figure 5. (a) Prefetch filter with fields for tracking NLPs and the prefetch issue
Figure 6 of the paper
Figure 6. Overall flow for prefetch issuance. Both quantities are tracked in 16-bit registers
Figure 7 of the paper
Figure 7. (a)-(c) Speedups attained by using different prefetchers over a baseline with no prefetchers for different benchmark suites and core configurations.
Figure 8 of the paper
Figure 8. Across different suites: (a) Covered and overpredicted prefetches; (b)
Figure 10 of the paper
Figure 10. Robustness of Augur to (a) DRAM bandwidth constrained systems and (b) LLC capacity limited systems. 4 8 32 64 History length (HL) 1.400 1.425 1.450 1.475 1.500 1.525 1.550 1.575 1.600 Geomean speedup over no prefetch baseline Modified Augur Base Augur (HL: 16) Pythia (a) 4 8 32 64 128 Number of tracked PCs NPC 1.400 1.425 1.450 1.475 1.500 1.525 1.550 1.575 1.600 Geomean speedup over no prefetch baseline Modified Augur Base Augur (16 PCs) Pythia (b)
Figure 11 of the paper
Figure 11. Sensitivity of Augur to reservoir configurations with different (a) history lengths (HL) and (b) tracked PCs (NP C ). were performed over the SPEC 2006 and SPEC 2017 with single-core configuration. 1) Varying the memory bandwidth
Figure 12 of the paper
Figure 12. Geo-mean speedups for (a) Augur-R (no Markov predictor); (b) Augur over Baseline++. relative speedup of 1.3% over Pythia. We also show that the number of PCs tracked by Augur can be reduced to 8 while still achieving a 1.1% speedup over Pythia. F. Ablation studies We now show the results of two ablation studies: (1) Augur without the Markov predictor (Augur-R), and (2) A cost-equivalent baseline with a larger L2C (Baseline++). 1) Augur without the Markov predictor: We call Augur without the Markov predictor Augur-R
Figure 13 of the paper
Figure 13. Component isolation: geomean speedup over Pythia (“All” = the 42 GAP, Ligra, and llama2 traces). TABLE VII ISSUED/USEFUL SHARE (ACCURACY) BY SOURCE; LATE: AU G U R/PYTHIA (%) Suite Reservoir Markov NL fallback NL warm-up Late GAP 25/39 (84) 3/2 (28) 71/60 (46) 0/0 1/8 Ligra 49/79 (82) 6/2 (17) 45/19 (21) 0/0 7/14 PARSEC 48/65 (54) 15/20 (50) 28/13 (18) 9/3 6/25 SPEC06 31/42 (79) 21/22 (61) 14/9 (39) 34/26 20/13 SPEC17 43/62 (72) 19/24 (62) 11/3 (12) 27/11 13/18 AI 63/73 (69) 28/20 (42) 3/1 (26) 6/6 63/59 All 44/59 (73) 20/21 (55) 15/8 (29) 22/13 26/23 for a single-core…
Figure 14 of the paper
Figure 14. (a) Exact-match accuracy vs. accesses since a PC was (re)initialized; (b) per-trace speedup of Augur over Pythia (137 single-core traces, sorted). GAP and Ligra, under 0.2%, and 8 or 32 PCs instead of 16 change performance by at most 0.3%. Per-trace medians range from 26 (Ligra) to 180 (SPEC06) distinct load PCs and from 0.6 (PARSEC) to 48 (GAP) L2 load MPKI. Sensitivity and storage. On GAP+Ligra, the learning rate (2 −10–2 −14) and its schedule, the Markov margin, the confidence threshold, the history length (4–32), the PC count, and the bias each change performance by less than…

Showing 13 of the paper's 14 figures. Figures are the authors', reproduced from the paper.

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment