Por favor, use este identificador para citar o enlazar este ítem: https://doi.org/10.1109/HPCA61900.2025.00016

Título: MASCOT: Predicting memory dependencies and opportunities for speculative memory bypassing
Fecha de publicación: 8-abr-2025
Editorial: IEEE Computer Society
ISSN: Electronic: 2378-203X
ISBN: Electronic: 979-8-3315-0647-6
Palabras clave: Mascot
Memory bypassing
Memory dependence
Memory dependence prediction
Memory prediction
Speculative memory bypassing
Value prediction
Resumen: Memory-dependence prediction (MDP) increases instruction-level parallelism (ILP) by allowing load instructions to be issued even when addresses in the store queue are unknown. The predictor determines whether a load will alias with a prior store, delaying issue when a dependence is predicted. Speculative memory bypassing (SMB) further enhances ILP by short-circuiting a predicted dependence to forward the value written by a store to a load that is predicted to depend on it, without their addresses necessarily being known. This breaks data dependencies on the load and store addresses, allowing loads to obtain their values much earlier than they normally would. To obtain benefits, dependencies must be predicted with high accuracy. Furthermore, the benefits are skewed, with false negatives being more costly for performance than false positives for MDP, since the former requires squashing when the misprediction is identified, whereas the latter only delays the issue of independent loads. For SMB, on the other hand, false positives are very costly, as they require squashing, whereas false negatives have little impact in the presence of an accurate memory dependence predictor. Due to these differing requirements, the designs of predictors for these mechanisms have diverged. In this paper, we propose MASCOT, a novel predictor capable of performing both MDP and SMB. MASCOT is inspired by the TAGE predictor, widely used in branch prediction. Although TAGE has proven effective as a universal predictor structure, we demonstrate how prior TAGE-based MDP or SMB predictors suffer from inaccuracy due to not learning patterns of nondependence. By learning the context for dependencies as well as non-dependencies, MASCOT achieves sufficiently low false negatives and false positives to perform MDP and SMB, while at the same time uses less space than existing designs that only perform MDP or SMB. Our simulation results show that for SPEC CPU 2017, MASCOT used for MDP alone yields an IPC gain of 0.4 % over the previous state-of-the-art predictor, on average, at the same size. When used for both MDP and SMB, it yields an increase in IPC of 1.9 % on average, with peak gains of 26 %. A compacted version of MASCOT, MASCOT-OPT, achieves similar numbers within 0.1 % while using just 10.1 KiB of space.
Autor/es principal/es: Mose, Karl H.
Kim, Sebastian S.
Ros Bardisa, Alberto
Jones, Timothy M.
Mullins, Robert D.
Forma parte de: 31st Symposium on High Performance Computer Architecture (HPCA), IEEE International 2025, pp. 59-71
Versión del editor: https://ieeexplore.ieee.org/document/10946798
URI: http://hdl.handle.net/10201/154742
DOI: https://doi.org/10.1109/HPCA61900.2025.00016
Tipo de documento: info:eu-repo/semantics/article
Número páginas / Extensión: 13
Derechos: info:eu-repo/semantics/openAccess
Atribución 4.0 Internacional
Descripción: © 2025 IEEE. This manuscript version is made available under the CC-BY 4.0 license http://creativecommons.org/licenses/by/4.0/ This document is the Accepted Manuscript version of a Published Work that appeared in final form in 2025 IEEE International. To access the final edited and published work see https://doi.org/10.1109/HPCA61900.2025.00016
Aparece en las colecciones:Artículos

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
kmose-hpca25.pdf670,29 kBAdobe PDFVista previa
Visualizar/Abrir


Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons