Storage-Free Memory Dependency Prediction - Archive ouverte HAL Access content directly
Journal Articles IEEE Computer Architecture Letters Year : 2016

Storage-Free Memory Dependency Prediction

Abstract

Memory Dependency Prediction (MDP) is paramount to good out-of-order performance, but decidedly not trivial as a all instances of a given static load may not necessarily depend on all instances of a given static store. As a result, for a given load, MDP should predict the exact store instruction the load depends on, and not only whether it depends on an inflight store or not, i.e., ideally, prediction should not be binary. However, we first argue that given the high degree of sophistication of modern branch predictors, the fact that a given dynamic load depends on an inflight store can be captured using the binary prediction capabilities of the branch predictor, providing coarse MDP at zero storage overhead. Second, by leveraging hysteresis counters, we show that the precise producer store can in fact be identified. This embodiment of MDP yields performance levels that are on par with state-of-the-art, and requires less than 70 additional bits of storage over a baseline without MDP at all.
Fichier principal
Vignette du fichier
cal_preprint.pdf (373.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01396985 , version 1 (15-11-2016)

Identifiers

Cite

Arthur Perais, André Seznec. Storage-Free Memory Dependency Prediction. IEEE Computer Architecture Letters, 2016, pp.1 - 4. ⟨10.1109/LCA.2016.2628379⟩. ⟨hal-01396985⟩
241 View
602 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More