PG-MDP: Profile-Guided Memory Dependence Prediction for Area-Constrained Cores
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914461796794368 |
|---|---|
| author | Panayi, Luke Jino, Johan Kim, Sebastian S. Ros, Alberto Jimborean, Alexandra Whittaker, Jim Berger, Martin Kelly, Paul |
| author_facet | Panayi, Luke Jino, Johan Kim, Sebastian S. Ros, Alberto Jimborean, Alexandra Whittaker, Jim Berger, Martin Kelly, Paul |
| contents | Memory Dependence Prediction (MDP) is a speculative technique to determine which stores, if any, a given load will depend on. Area-constrained cores are increasingly relevant in various applications such as energy-efficient or edge systems, and often have limited space for MDP tables. This leads to a high rate of false dependencies as memory independent loads alias with unrelated predictor entries, causing unnecessary stalls in the processor pipeline.
The conventional way to address this problem is with greater predictor size or complexity, but this is unattractive on area-constrained cores. This paper proposes that targeting the predictor working set is as effective as growing the predictor, and can deliver performance competitive with large predictors while still using very small predictors. This paper introduces profile-guided memory dependence prediction (PG-MDP), a software co-design to label consistently memory independent loads via their opcode and remove them from the MDP working set. These loads bypass querying the MDP when dispatched and always issue as soon as possible. Across SPEC2017 CPU intspeed, PG-MDP reduces the rate of MDP queries by 79%, false dependencies by 77%, and improves geomean IPC for a small simulated core by 1.47% (to within 0.5% of using 16x the predictor entries), with no area cost and no additional instruction bandwidth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_08445 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | PG-MDP: Profile-Guided Memory Dependence Prediction for Area-Constrained Cores Panayi, Luke Jino, Johan Kim, Sebastian S. Ros, Alberto Jimborean, Alexandra Whittaker, Jim Berger, Martin Kelly, Paul Programming Languages Hardware Architecture B.0; B.8; C.1 Memory Dependence Prediction (MDP) is a speculative technique to determine which stores, if any, a given load will depend on. Area-constrained cores are increasingly relevant in various applications such as energy-efficient or edge systems, and often have limited space for MDP tables. This leads to a high rate of false dependencies as memory independent loads alias with unrelated predictor entries, causing unnecessary stalls in the processor pipeline. The conventional way to address this problem is with greater predictor size or complexity, but this is unattractive on area-constrained cores. This paper proposes that targeting the predictor working set is as effective as growing the predictor, and can deliver performance competitive with large predictors while still using very small predictors. This paper introduces profile-guided memory dependence prediction (PG-MDP), a software co-design to label consistently memory independent loads via their opcode and remove them from the MDP working set. These loads bypass querying the MDP when dispatched and always issue as soon as possible. Across SPEC2017 CPU intspeed, PG-MDP reduces the rate of MDP queries by 79%, false dependencies by 77%, and improves geomean IPC for a small simulated core by 1.47% (to within 0.5% of using 16x the predictor entries), with no area cost and no additional instruction bandwidth. |
| title | PG-MDP: Profile-Guided Memory Dependence Prediction for Area-Constrained Cores |
| topic | Programming Languages Hardware Architecture B.0; B.8; C.1 |
| url | https://arxiv.org/abs/2604.08445 |