Agustín Navarro-Torres

Agustín Navarro-Torres

Auto-generated profile, based on publicly available information

Agustín Navarro-Torres

Computer Engineering Department, University of Murcia, Murcia, Spain

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2019 in PLOS ONE
Verified
Journal Article
Open access
PDF file
ANAgustín Navarro-Torres
Agustín Navarro-Torres
Jesús Alastruey-BenedéJesús Alastruey-Benedé
Jesús Alastruey-Benedé
PIPablo Ibáñez-Marín
Pablo Ibáñez-Marín
VVVíctor Viñals-Yúfera
Víctor Viñals-Yúfera
SPEC CPU is one of the most common benchmark suites used in computer architecture research. CPU2017 has recently been released to replace CPU2006. In this paper we present a detailed evaluation of the memory hierarchy performance for both the CPU2006 and single-threaded CPU2017 benchmarks. The experiments were executed on an Intel Xeon Skylake-SP, which is the first Intel processor to implement a mostly non-inclusive last-level cache (LLC). We present a classification of the benchmarks according to their memory pressure and analyze the performance impact of different LLC sizes. We also test all the hardware prefetchers showing they improve performance in most of the benchmarks. After comprehensive experimentation, we can highlight the following conclusions: i) almost half of SPEC CPU benchmarks have very low miss ratios in the second and third level caches, even with small LLC sizes and without hardware prefetching, ii) overall, the SPEC CPU2017 benchmarks demand even less memory hierarchy resources than the SPEC CPU2006 ones, iii) hardware prefetching is very effective in reducing LLC misses for most benchmarks, even with the smallest LLC size, and iv) from the memory hierarchy standpoint the methodologies commonly used to select benchmarks or simulation points do not guarantee representative workloads.

31 January 2025 in IEEE Transactions on Computers
Verified
Journal Article
Open access
ANAgustín Navarro-Torres
Agustín Navarro-Torres
BPBiswabandan Panda
Biswabandan Panda
Jesús Alastruey-BenedéJesús Alastruey-Benedé
Jesús Alastruey-Benedé
PIPablo Ibáñez
Pablo Ibáñez
VYVíctor Viñals Yufera
Víctor Viñals Yufera
ARAlberto Ros
Alberto Ros
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.

22 June 2019
Verified
Conference Paper
Open access
PDF file
AVAlejandro Valero
Alejandro Valero
DGDarío Suárez Gracia
Darío Suárez Gracia
RTRuben Gran Tejero
Ruben Gran Tejero
LRLuis M. Ramos
Luis M. Ramos
ANAgustín Navarro-Torres
Agustín Navarro-Torres
VVVíctor Viñals
Víctor Viñals