Alberto Ros
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alberto Ros has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
Manuel E. Acacio
17 shared publications- Jose Manuel García
Universidad de Murcia
15 shared publications - Manuel E. Acacio
Universidad de Murcia, Murcia, Spain
10 shared publications - Alexandra Jimborean
Computer Engineering Department, University of Murcia, Murcia, Spain
8 shared publications - Ricardo Fernández-Pascual
Universidad de Murcia
8 shared publications Stefanos Kaxiras
7 shared publications
Latest Publications
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 978-992
ICARUS: Criticality and Reuse based Instruction Caching for Datacenter Applications
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 978-992
Open AccessICARUS: Criticality and Reuse based Instruction Caching for Datacenter Applications
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 130-133
Untangling the Low Accuracy of the Entangling Instruction Prefetcher
The Entangling Instruction Prefetcher (EIP) is a state-of-the-art mechanism designed to improve instruction-fetch timeliness. While earlier studies report an average prefetch accuracy of 72% and as high as 91%, more recent evaluations using different methodologies—most notably the gem5 simulator— report lower accuracies of 44% on average and even below 30%. This work aims to shed light on this controversy by providing a robust and faithful open-source implementation within the gem5 simulation framework. In addition, we analyze several design choices that influence EIP's accuracy and performance highlighting common pitfalls when porting EIP across simulators. In our experiments, using the same benchmarks as prior studies, our gem5 version of EIP achieves an average prefetch accuracy of 64.35%, demonstrating that its accuracy remains stable across the simulators.
- 20 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 25 (1) , 130-133
Untangling the Low Accuracy of the Entangling Instruction Prefetcher
The Entangling Instruction Prefetcher (EIP) is a state-of-the-art mechanism designed to improve instruction-fetch timeliness. While earlier studies report an average prefetch accuracy of 72% and as high as 91%, more recent evaluations using different methodologies—most notably the gem5 simulator— report lower accuracies of 44% on average and even below 30%. This work aims to shed light on this controversy by providing a robust and faithful open-source implementation within the gem5 simulation framework. In addition, we analyze several design choices that influence EIP's accuracy and performance highlighting common pitfalls when porting EIP across simulators. In our experiments, using the same benchmarks as prior studies, our gem5 version of EIP achieves an average prefetch accuracy of 64.35%, demonstrating that its accuracy remains stable across the simulators.
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 58-65
In-Core, Low-Cost Hardware Transactional Memory
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 58-65
In-Core, Low-Cost Hardware Transactional Memory
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (2) , 221-224
Correct Wrong Path
Modern OOO CPUs have very deep pipelines with large branch misprediction recovery penalties. Speculatively executed instructions on the wrong path can significantly change cache state, depending on speculation levels. Architects often employ trace-driven simulation models in the design exploration stage, which sacrifice precision for speed. Trace-driven simulators are orders of magnitude faster than execution-driven models, reducing the often hundreds of thousands of simulation hours needed to explore new micro-architectural ideas. Despite the strong benefits of trace-driven simulation, it often fails to adequately model the consequences of wrong-path execution because obtaining such traces from real systems is nontrivial. Prior works exclusively consider either pollution or prefetching in the instruction stream/L1-I cache and often ignore the impact on the data stream. Here, we examine wrong path execution in simulation results and design a set of infrastructure for enabling wrong-path execution in a trace driven simulator. Our analysis shows the wrong path affects structures on both the instruction and data sides extensively, resulting in performance variations ranging from$-3.05$ % to 20.9% versus ignoring wrong path. To benefit the research community and enhance the accuracy of simulators, we opened our traces and tracing utility in the hopes that industry can provide wrong-path traces generated by their internal simulators, enabling academic simulation without exposing industry IP.- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (2) , 221-224
Correct Wrong Path
Modern OOO CPUs have very deep pipelines with large branch misprediction recovery penalties. Speculatively executed instructions on the wrong path can significantly change cache state, depending on speculation levels. Architects often employ trace-driven simulation models in the design exploration stage, which sacrifice precision for speed. Trace-driven simulators are orders of magnitude faster than execution-driven models, reducing the often hundreds of thousands of simulation hours needed to explore new micro-architectural ideas. Despite the strong benefits of trace-driven simulation, it often fails to adequately model the consequences of wrong-path execution because obtaining such traces from real systems is nontrivial. Prior works exclusively consider either pollution or prefetching in the instruction stream/L1-I cache and often ignore the impact on the data stream. Here, we examine wrong path execution in simulation results and design a set of infrastructure for enabling wrong-path execution in a trace driven simulator. Our analysis shows the wrong path affects structures on both the instruction and data sides extensively, resulting in performance variations ranging from$-3.05$ % to 20.9% versus ignoring wrong path. To benefit the research community and enhance the accuracy of simulators, we opened our traces and tracing utility in the hopes that industry can provide wrong-path traces generated by their internal simulators, enabling academic simulation without exposing industry IP.- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (1) , 157-160
WoperTM: Got Nacks? Use Them!
The simplicity of requester-wins has made it the preferred choice for conflict resolution in commercial implementations of Hardware Transactional Memory (HTM), which typically have relied on conventional locking to escape from conflict-induced livelocks. Prior work advocates for combining requester-wins and requester-loses to ensure progress for higher-priority transactions, yet it fails to take full advantage of the available features, namely, protocol support for nacks. This paper introduces WoperTM, a dual-policy, best-effort HTM design that resolves conflicts using requester-loses policy in the common case. Our key insight is that, since nacks are required to support priorities in HTM, performance can be improved at nearly no extra cost by allowing regular transactions to benefit from requester-loses, instead of only those involving a high-priority transaction. Experimental results using gem5 and STAMP show that WoperTM can significantly reduce squashed work and improve execution times by 12% with respect to power transactions, with negligible hardware overhead.
- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (1) , 157-160
WoperTM: Got Nacks? Use Them!
The simplicity of requester-wins has made it the preferred choice for conflict resolution in commercial implementations of Hardware Transactional Memory (HTM), which typically have relied on conventional locking to escape from conflict-induced livelocks. Prior work advocates for combining requester-wins and requester-loses to ensure progress for higher-priority transactions, yet it fails to take full advantage of the available features, namely, protocol support for nacks. This paper introduces WoperTM, a dual-policy, best-effort HTM design that resolves conflicts using requester-loses policy in the common case. Our key insight is that, since nacks are required to support priorities in HTM, performance can be improved at nearly no extra cost by allowing regular transactions to benefit from requester-loses, instead of only those involving a high-priority transaction. Experimental results using gem5 and STAMP show that WoperTM can significantly reduce squashed work and improve execution times by 12% with respect to power transactions, with negligible hardware overhead.
- Open Access
- 31 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (5) , 1482-1494
A Complexity-Effective Local Delta Prefetcher
Data prefetching is crucial for performance in modern processors by effectively masking long-latency memory accesses. Over the past decades, numerous data prefetching mechanisms have been proposed, which have continuously reduced the access latency to the memory hierarchy. Several state-of-the-art prefetchers, namely Instruction Pointer Classifier Prefetcher (IPCP) and Berti, target the first-level data cache, and thus, they are able to completely hide the miss latency for timely prefetched cache lines. Berti exploits timely local deltas to achieve high accuracy and performance. This paper extends Berti with a larger evaluation and with extra optimizations on top of the previous conference paper. The result is a complexity-effective version of Berti that outperforms it for a large amount of workloads and simplifies its control logic. The key for those advancements is a simple mechanism for learning timely deltas without the need to track the fetch latency of each cache miss. Our experiments conducted with a wide range of workloads (CVP traces by Qualcomm, SPEC CPU2017, and GAP) show performance improvements by 4.0% over a mainstream stride prefetcher, and by a non-negligible 1.4% over the previously published version of Berti requiring similar storage.
- 31 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (5) , 1482-1494
Open AccessA Complexity-Effective Local Delta Prefetcher
Data prefetching is crucial for performance in modern processors by effectively masking long-latency memory accesses. Over the past decades, numerous data prefetching mechanisms have been proposed, which have continuously reduced the access latency to the memory hierarchy. Several state-of-the-art prefetchers, namely Instruction Pointer Classifier Prefetcher (IPCP) and Berti, target the first-level data cache, and thus, they are able to completely hide the miss latency for timely prefetched cache lines. Berti exploits timely local deltas to achieve high accuracy and performance. This paper extends Berti with a larger evaluation and with extra optimizations on top of the previous conference paper. The result is a complexity-effective version of Berti that outperforms it for a large amount of workloads and simplifies its control logic. The key for those advancements is a simple mechanism for learning timely deltas without the need to track the fetch latency of each cache miss. Our experiments conducted with a wide range of workloads (CVP traces by Qualcomm, SPEC CPU2017, and GAP) show performance improvements by 4.0% over a mainstream stride prefetcher, and by a non-negligible 1.4% over the previously published version of Berti requiring similar storage.
- Open Access
- 10 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-30
Bounding Speculative Execution of Atomic Regions to a Single Retry
- 10 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-30
Open AccessBounding Speculative Execution of Atomic Regions to a Single Retry
- 1 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (2) , 548-559
Wrong-Path-Aware Entangling Instruction Prefetcher
Instruction prefetching is instrumental for guaranteeing a high flow of instructions through the processor front end for applications whose working set does not fit in the lower-level caches. Examples of such applications are server workloads, whose instruction footprints are constantly growing. There are two main techniques to mitigate this problem: fetch directed prefetching (or decoupled front end) and instruction cache (L1I) prefetching. This work extends the state-of-the-art Entangling prefetcher to avoid training during wrong-path execution. Our Entangling wrong-path-aware prefetcher is equipped with microarchitectural techniques that eliminate more than 99% of wrong-path pollution, thus reaching 98.9% of the performance of an ideal wrong-path-aware solution. Next, we propose two microarchitectural optimizations able to further increase performance benefits by 1.8%, on average. All this is achieved with just 304 bytes. Finally, we study the interplay between the L1I prefetcher and a decoupled front end. Our analysis shows that due to pollution caused by wrong-path instructions, the degree of decoupling cannot be increased unlimitedly without negative effects on the energy-delay product (EDP). Furthermore, the closer to ideal is the L1I prefetcher, the less decoupling is required. For example, our Entangling prefetcher reaches an optimal EDP with a decoupling degree of 64 instructions.
- 1 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (2) , 548-559
Wrong-Path-Aware Entangling Instruction Prefetcher
Instruction prefetching is instrumental for guaranteeing a high flow of instructions through the processor front end for applications whose working set does not fit in the lower-level caches. Examples of such applications are server workloads, whose instruction footprints are constantly growing. There are two main techniques to mitigate this problem: fetch directed prefetching (or decoupled front end) and instruction cache (L1I) prefetching. This work extends the state-of-the-art Entangling prefetcher to avoid training during wrong-path execution. Our Entangling wrong-path-aware prefetcher is equipped with microarchitectural techniques that eliminate more than 99% of wrong-path pollution, thus reaching 98.9% of the performance of an ideal wrong-path-aware solution. Next, we propose two microarchitectural optimizations able to further increase performance benefits by 1.8%, on average. All this is achieved with just 304 bytes. Finally, we study the interplay between the L1I prefetcher and a decoupled front end. Our analysis shows that due to pollution caused by wrong-path instructions, the degree of decoupling cannot be increased unlimitedly without negative effects on the energy-delay product (EDP). Furthermore, the closer to ideal is the L1I prefetcher, the less decoupling is required. For example, our Entangling prefetcher reaches an optimal EDP with a decoupling degree of 64 instructions.
- Open Access
- 2 January 2023
- Published by European Dissemination Media Agency Limited in The Project Repository Journal
- Vol. 16 (1) , 34-37
Towards faster, greener and easier to program computers
Towards faster, greener and easier to program computers: The ERC Consolidator Grant project ECHO (Extending Coherence for Hardware-Driven Optimizations in Multicore Architectures) aims to change the events that occur in multiprocessors such that predictions or decisions being made by the processing units will find the best possible outcome in the future. This way, large performance and energy improvements are expected in future computers leveraging ECHO concepts.
- 2 January 2023
- Published by European Dissemination Media Agency Limited in The Project Repository Journal
- Vol. 16 (1) , 34-37
Open AccessTowards faster, greener and easier to program computers
Towards faster, greener and easier to program computers: The ERC Consolidator Grant project ECHO (Extending Coherence for Hardware-Driven Optimizations in Multicore Architectures) aims to change the events that occur in multiprocessors such that predictions or decisions being made by the processing units will find the best possible outcome in the future. This way, large performance and energy improvements are expected in future computers leveraging ECHO concepts.
- Open Access
- 21 November 2022
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 173, 94-106
Speculative inter-thread store-to-load forwarding in SMT architectures
- 21 November 2022
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 173, 94-106
Open AccessSpeculative inter-thread store-to-load forwarding in SMT architectures