Skip to main content

JERARQUIA DE MEMORIA, GESTION DE TAREAS Y OPTIMIZACION DE APLICACIONES

PID2019-105660RB-C21

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 52
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improving the Configuration of the Predictable ACDC Data Cache for Real-Time Systems

  • Segarra, Juan
  • Martí-Campoy, Antonio|||0000-0002-6009-8703
[EN] In real-time systems, analyzing the worst-case execution time (WCET) of a task in the presenceof data caches is hard. The ACDC is a data cache that provides predictability, facilitating WCET analysis.It works by granting data cache replacement permission to speci_c load/store instructions. Nonetheless,knowing how to select these instructions to minimize the WCET, i.e., con_guring the ACDC, is not trivial. In this paper, we propose four new methods to con_gure the ACDC, and compare them with existingmethods. Unlike those in previous studies, our proposed methods provide speci_c ACDC con_gurationsfor the different phases of a given task, instead of a single ACDC con_guration per task. We evaluate theWCET bounds obtained when using different ACDC con_guration methods on the TACLeBench benchmark suite. Our results show that the most complex benchmarks work better with multiple-content con_gurations,which indicates that realistic tasks may also bene_t from this kind of con_guration. The methods proposedin this study improve the WCET in more than 60% of cases, with an average WCET improvement of nearly5% and up to 50% in some cases., This work was supported in part by the Ministerio de Ciencia e Innovacion (MCIN)/Agencia Estatal de Investigacion (AIE)/10.13039/501100011033 under Grant PID2019-105660RB-C21 and Grant PID2020-117713RB-I00; and in part by the Government of Aragon, Research Group, under Grant T5820R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Fast-Track Cache: A Huge Racetrack Memory L1 Data Cache

  • Tárrega, Hugo
  • Valero, Alejandro
  • Lorente Garcés, Vicente Jesús
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] First-level (L1) caches have been traditionally implemented with Static Random-Access Memory (SRAM) technology, since it is the fastest memory technology, and L1 caches call for tight timing constraints in the processor pipeline. However, one of the main downsides of SRAM is its low density, which prevents L1 caches to improve their storage capacity beyond a few tens of KB. On the other hand, the recent Domain Wall Memory (DWM) technology overcomes such a constraint by arranging multiple bits in a mag- netic racetrack, and sharing a header to access those bits. Accessing a bit requires a shift operation to align the target bit under the header. Such shifts increase the final access latency, which is the main reason why DWM has been mostly used to implement slow last-level caches. This paper proposes a novel DWM-based L1 cache data array design, namely Fast-Track Cache (FTC), that allows L1 caches with bigger storage capacities while reducing the shift overhead thanks to an enhanced exploitation of spatial and temporal localities. Experimental results show that most FTC accesses do not re- quire shifts. As a consequence, and due to its larger capacity, FTC improves the processor performance on average by 15% over a conventional SRAM memory subsystem and the state-of-the-art TapeCache architecture based on DWM. At the same time, energy savings are improved on average by 34% over the conventional design., This work has been partially supported by Ministerio de Ciencia, Innovación y Universidades and the European ERDF under Grant RTI2018-098156-B-C51, by Agencia Estatal de Investigación (AEI) under Grant PID2019-105660RB-C21/AEI/10.13039/501100011033, and by Dept. of Science, University, and Knowledge Society, Government of Aragon, under Grant gaZ: T5820R research group.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Control inteligente mediante escalado dinámico voltaje-frecuencia (DVFS) de la temperatura en procesadores embebidos, Intelligent control of temperature with dynamic voltage-frequency scaling (DVFS) in embedded processors

  • Hernández-Almudi, P.
  • Suárez, D.
  • Montijano, E.
  • Merino, J.
[EN] The increment in computing power of embedded processors has fueled a revolution in many application domains such as mobile computing or robotics. Dissipating the energy consumed by those processors on a very small area has made power management a first-order constraint. On one hand, it is impossible to directly apply active dissipation techniques. On the other hand, design requirements prevent the correct behaviour of known passive detection techniques. To alleviate this problem, we present a new control approach to keep the temperature of the system controlled through the Dynamic Voltage and Frequency Scaling (DVFS) system. The solution includes a feedback control scheme together with a supervisor that adjusts the control parameters based on the system load. To ease experimentation without compromising real use, the code can run in user space and as a Linux kernel driver. The experiments in a real platform prove that, compared to the current control methodology, our approach handles the processor’s temperature with more precision, keeping similar performance levels in the execution of well known benchmarks., [ES] El aumento de la capacidad de cálculo de los procesadores embebidos ha generado una revolución en numerosos dominios de aplicación como la computación móvil o la robótica. La disipación del consumo producido por estos cálculos en una superficie tan pequeña hace que la disipación de energía suponga un problema de primer orden. Por un lado, no es posible aplicar técnicas de disipación activas y, por otro, las exigencias de diseño impiden una correcta disipación pasiva. Para resolver este problema, este trabajo presenta una metodología de control para el mantenimiento de una temperatura bajo control mediante el uso de escalado dinámico de la frecuencia del procesador (DVFS, Dynamic Voltage Frequency Scaling). La solución incluye un esquema de control de temperatura basado en realimentación junto con un supervisor que ajusta los parámetros del controlador en base al tipo de carga del trabajo. La estrategia de control propuesta se ha implementado tanto en espacio de usuario como driver dentro del kernel de Linux. Los experimentos realizados en una plataforma real demuestran que, comparado con el control existente en la actualidad, nuestra propuesta es capaz de gestionar la temperatura del procesador con más precisión, manteniendo niveles similares de eficiencia en la ejecución de benchmarks conocidos., Este artículo ha sido financiado parcialmente por los proyectos PGC2018-098817-A-I00 (MCIU/AEI/FEDER, UE), MIG20201006, PID2019-105660RB-C21 ( MINECO/AEI/FEDER), Grupos T58 20R y T45 20R ( Gobierno de Aragón) y FEDER 2014-2020 “Construyendo Europa desde Aragón”. Los autores agradecen el apoyo recibido.
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

HyCSim: A rapid design space exploration tool for emerging hybrid last-level caches

  • Escuín Blasco, Carlos
  • Ali Khan, Asif
  • Ibáñez Marín, Pablo Enrique
  • Monreal Arnal, Teresa|||0000-0002-0458-2234
  • Viñals Yúfera, Victor
  • Castrillón, Jerónimo
Recent years have seen a rising trend in the exploration of non-volatile memory (NVM) technologies in the memory subsystem. Particularly in the cache hierarchy, hybrid last-level cache (LLC) solutions are proposed to meet the wide-ranging performance and energy requirements of modern days applications. These emerging hybrid solutions need simulation and detailed exploration to fully understand their capabilities before exploiting them. Existing simulation tools are either too slow or incapable of prototyping such systems and optimizing for NVM devices. To this end, we propose HyCSim, a trace-driven simulation infrastructure that enables rapid comparison of various hybrid LLC configurations for different optimization objectives. Notably, HyCSim makes it possible to quickly estimate the impact of various hybrid LLC insertion and replacement policies, disabling of a cache region at byte or cache frame granularity for different fault maps. In addition, HyCSim allows to evaluate the impact of various compression schemes on the overall performance (hit and miss rate) and the number of writes to the LLC. Our evaluation on ten multi-program workloads from the SPEC 2006 benchmarks suite shows that HyCSim accelerates the simulation time by 24×, compared to the cycle-accurate Gem5 simulator, with high-fidelity., This work was partially funded by the HiPEAC collaboration grant 2020, the German Research Council (DFG) through the TraceSymm project (366764507) and the Co4RTM project (450944241), MCIN/AEI/10.13039/501100011033 (grants PID2019-105660RB-C21 and PID2019- 107255GB-C22), and by Aragón Government (T5820R research group)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Pronóstico de capacidad efectiva y prestaciones en una cache no volátil de último nivel

  • Escuín Blasco, Carlos
  • Monreal Arnal, Teresa|||0000-0002-0458-2234
  • Llaberia Griñó, José M.|||0000-0002-3753-4108
  • Ibáñez Marín, Pablo Enrique
  • Viñals Yúfera, Victor
La degradación debida a las escrituras que sufren las bitcells implementadas con tecnologi´as de memoria no volátil (NVM) es uno de los principales escollos que se presentan a la hora de construir la cache de último nivel (LLC) con estas tecnologi´as. Aunque en la literatura se recogen diferentes propuestas para hacer frente a esta degradación, la metodologi´a usada en los trabajos previos no permite estudiar en detalle la evolución de la capacidad efectiva ni de las prestaciones en una cache no volátil de último nivel (NV-LLC). Por ello, en este trabajo se propone un procedimiento de pronóstico que combina simulación y predicción con el objetivo de estudiar dicha evolución. Por otra parte, la compresión es una de las técnicas propuestas en la literatura para lidiar con la degradación de las memorias no volátiles. En primer lugar, la compresión diminuye la cantidad de información escrita en una NV-LLC. En segundo lugar, cuando los contenedores ven mermada su capacidad debido a la degradación, la compresión permite mantener su funcionalidad albergando bloques de tamaño reducido. El procedimiento de pronóstico desarrollado en este trabajo permite evaluar el impacto de diferentes técnicas y mecanismos de gestión de contenidos en la esperanza de vida y las prestaciones de una NV-LLC de manera detallada. El mecanismo de compresión adoptado en este trabajo multiplica hasta por 5 veces la esperanza de vida de una NV-LLC., Este trabajo ha sido financiado por MINECO/AEI/FEDER (UE) (proyectos PID2019-105660RB-C21 y PID2019-107255GB-C22 / AEI / 10.13039/501100011033), el Gobierno de Aragon (Grupo T58 20R) y FEDER 2014-2020 “Construyendo Europa desde Aragón”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Análisis seguro y automático del reúso de datos en aplicaciones de tiempo real estricto sobre arquitectura x64

  • Moreno Martín Viveros, Álvaro|||0009-0006-7303-350X
  • Segarra Flor, Juan
  • Gran Tejero, Rubén
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
El análisis del reúso de datos presente en una aplicación es una de las técnicas que ha demostrado ser efectiva para obtener mejores resultados en el cálculo del tiempo de ejecución en el peor caso en sistemas con memorias caché de datos. Como prueba de concepto de esta metodología han sido desarrolladas herramientas como polygaz, una utilidad que permite extraer de forma segura y fiable una clasificación del reúso de datos presente en binarios compilados sobre arquitectura ARMv7. Esta información independiente de la memoria caché utilizada permite, posteriormente, realizar un cálculo más preciso del tiempo de ejecución en el caso peor sobre el sistema de tiempo real que se busque estudiar. En este artículo se pretende explorar la funcionalidad de la herramienta al analizar binarios compilados sobre otra arquitectura mayoritaria (x64) y que presenta una filosofía distinta a ARMv7 (CISC vs RISC). Además, se estudia cómo puede afectar a los resultados en el reúso de datos obtenido emplear compiladores distintos (clang y gcc) a la hora de generar binarios para la misma aplicación de alto nivel. De esta manera, se ha ampliado la herramienta para permitir el análisis de la nueva arquitectura, y se ha planteado un entorno experimental donde se ha analizado un subconjunto de la colección TACLeBench usando gcc y clang con dos niveles de optimización (O0 y O2). Los resultados obtenidos muestran cómo la metodología de análisis aplicada permite también capturar el reúso de datos en la arquitectura x64 de forma efectiva. Además, muestran el efecto de utilizar compiladores diferentes, pudiéndose identificar diferencias en cómo se manifiesta el reúso de datos capturado entre ambas soluciones. Por último, a través de una estimación sencilla de los previsibles aciertos y fallos en base al reúso capturado, se calcula para ambos compiladores una reducción del tiempo en el peor caso de ejecución que supone alrededor del 20% del tiempo invertido en un sistema pesimista que solo predice fallos. Con optimizaciones este valor se estima que rondaría el 10%., Este trabajo ha sido financiado por el Ministerio de Ciencia e Innovación a través de los contratos PID2019-105660RB-C21 y PID2019-107255GBC21 (MCIN/AEI/10.13039/501100011033), además de por el Gobierno de Aragón (grupo T5820R)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

GenArchBench: A genomics benchmark suite for arm HPC processors

  • López Villellas, Lorien
  • Langarita Benítez, Rubén|||0000-0002-6080-724X
  • Badouh, Asaf
  • Soria Pardos, Víctor
  • Aguado Puig, Quim|||0000-0003-4871-3192
  • López Paradís, Guillem
  • Doblas Font, Max|||0000-0002-8909-3033
  • Setoain, Javier
  • Kim, Chulho
  • Ono, Makoto
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Arm usage has substantially grown in the High-Performance Computing (HPC) community. Japanese supercomputer Fugaku, powered by Arm-based A64FX processors, held the top position on the Top500 list between June 2020 and June 2022, currently sitting in the fourth position. The recently released 7th generation of Amazon EC2 instances for compute-intensive workloads (C7 g) is also powered by Arm Graviton3 processors. Projects like European Mont-Blanc and U.S. DOE/NNSA Astra are further examples of Arm irruption in HPC. In parallel, over the last decade, the rapid improvement of genomic sequencing technologies and the exponential growth of sequencing data has placed a significant bottleneck on the computational side. While most genomics applications have been thoroughly tested and optimized for x86 systems, just a few are prepared to perform efficiently on Arm machines. Moreover, these applications do not exploit the newly introduced Scalable Vector Extensions (SVE). This paper presents GenArchBench, the first genome analysis benchmark suite targeting Arm architectures. We have selected computationally demanding kernels from the most widely used tools in genome data analysis and ported them to Arm-based A64FX and Graviton3 processors. Overall, the GenArch benchmark suite comprises 13 multi-core kernels from critical stages of widely-used genome analysis pipelines, including base-calling, read mapping, variant calling, and genome assembly. Our benchmark suite includes different input data sets per kernel (small and large), each with a corresponding regression test to verify the correctness of each execution automatically. Moreover, the porting features the usage of the novel Arm SVE instructions, algorithmic and code optimizations, and the exploitation of Arm-optimized libraries. We present the optimizations implemented in each kernel and a detailed performance evaluation and comparison of their performance on four different HPC machines (i.e., A64FX, Graviton3, Intel Xeon Skylake Platinum, and AMD EPYC Rome). Overall, the experimental evaluation shows that Graviton3 outperforms other machines on average. Moreover, we observed that the performance of the A64FX is significantly constrained by its small memory hierarchy and latencies. Additionally, as proof of concept, we study the performance of a production-ready tool that exploits two of the ported and optimized genomic kernels., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, PID2022136454NB-C22, and TED2021-132634A-I00), by the Generalitat de Catalunya, Spain (contract 2021-SGR-763), by the Gobierno de Aragón (T58_23R research group), by the European Union NextGenerationEU/ PRTR, and by Lenovo BSC Contract-Framework Contract (2020)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

OpenPiton optimizations towards high performance manycores

  • Leyva Santes, Neiel Israel
  • Monemi, Alireza
  • Oliete Escuín, Noelia
  • López Paradís, Guillem
  • Abancens Calvo, Xabier
  • Balkind, Jonathan
  • Vallejo Gutiérrez, Enrique
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Álvarez Martí, Lluc|||0000-0003-0506-8867
In recent years, numerous multicore RISC-V platforms have emerged. Within the RISC-V ecosystem, Networks-on-Chip (NoCs) such as OpenPiton are employed in designs that aim to scale to a large number of cores. This paper presents a set of extensions and optimizations to OpenPiton for high-performance manycores. The key contributions are enabling multiple memory controllers, supporting router bypassing and NoC concentration, and adding support for configurable cache sizes and cache block sizes. On a 64-core manycore architecture, these new features and optimizations provide a geometric mean speedup of 6.5x compared to the OpenPiton baseline., This work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019- 107255GB-C21, PID2019-105660RB-C22 and TED2021-131176B-I00), by the Generalitat de Catalunya (contract 2021-SGR-00763), by the European Union within the framework of the ERDF of Catalonia 2014- 2020 under the DRAC project [001-P-001723] and by the European NextGenerationEU/PRTR, and by Lenovo-BSC Contract-Framework Contract (2022). The MEEP Project has received funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 946002. The JU receives support from the European Union’s Horizon 2020 research and innovation program and Spain, Croatia and Turkey. G. López-Paradís has been supported by the Generalitat de Catalunya through a FI fellowship 2021FI-B00994., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Porting and optimizing BWA-MEM2 using the Fujitsu A64FX processor

  • Langarita Benítez, Rubén|||0000-0002-6080-724X
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Ibáñez Marín, Pablo
  • Alastruey Benedé, Jesús
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Sequence alignment pipelines for human genomes are an emerging workload that will dominate in the precision medicine field. BWA-MEM2 is a tool widely used in the scientific community to perform read mapping studies. In this paper, we port BWA-MEM2 to the AArch64 architecture using the ARMv8-A specification, and we compare the resulting version against an Intel Skylake system both in performance and in energy-to-solution. The porting effort entails numerous code modifications, since BWA-MEM2 implements certain kernels using x86_64 specific intrinsics, e.g., AVX-512. To adapt this code we use the recently introduced Arm's Scalable Vector Extensions (SVE). More specifically, we use Fujitsu's A64FX processor, the first to implement SVE. The A64FX powers the Fugaku Supercomputer that led the Top500 ranking from June 2020 to November 2021. After porting BWA-MEM2 we define and implement a number of optimizations to improve performance in the A64FX target architecture. We show that while the A64FX performance is lower than that of the Skylake system, A64FX delivers 11.6% better energy-to-solution on average. All the code used for this article is available at https://gitlab.bsc.es/rlangari/bwa-a64fx, This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (contracts PID2019-107255GB-C21 / AEI /10.13039/501100011033 and PID2019-105660RB-C21 / AEI / 10.13039/501100011033), Gobierno de Aragon (T5820R research group), the Generalitat de Catalunya (contracts 2017-SGR-1328 and 2017-SGR1414), and the European Union’s Horizon 2020 research and innovation program (Mont-Blanc 2020 project, grant agreement 779877). Finally, A. Armejach and M. Moreto have been partially supported by the Spanish Ministry of Economy, Industry and Competitiveness under Juan de la Cierva fellowship no. IJCI-2017-33945 and Ramon y Cajal fellowship no. RYC-2016-21104, respectively., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Accurate and efficient constrained molecular dynamics of polymers using Newton's method and special purpose code

  • López Villellas, Lorién
  • Kjelgaard Mikkelsen, Carl Christian
  • Galano Frutos, Juan José
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo Enrique
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Sancho Sanz, Javier
  • García Risueño, Pablo
In molecular dynamics simulations we can often increase the time step by imposing constraints on bond lengths and bond angles. This allows us to extend the length of the time interval and therefore the range of physical phenomena that we can afford to simulate. We examine the existing algorithms and software for solving nonlinear constraint equations in parallel and we explain why it is necessary to advance the state-of-the-art. We present ILVES-PC, a new algorithm for imposing bond constraints on proteins accurately and efficiently. It solves the same system of differential algebraic equations as the celebrated SHAKE algorithm, but ILVES-PC solves the nonlinear constraint equations using Newton's method rather than the nonlinear Gauss-Seidel method. Moreover, ILVES-PC solves the necessary linear systems using a specialized linear solver that exploits the structure of the protein. ILVES-PC can rapidly solve constraint equations as accurately as the hardware will allow. The run-time of ILVES-PC is proportional to the number of constraints. We have integrated ILVES-PC into GROMACS and simulated proteins of different sizes. Compared with SHAKE, we have achieved speedups of up to 4.9× in single-threaded executions and up to 76× in shared-memory multi-threaded executions. Moreover, ILVES-PC is more accurate than P-LINCS algorithm. Our work is a proof-of-concept of the utility of software designed specifically for the simulation of polymers., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, and PID2019-107293GB-I00), by the Generalitat de Catalunya (contract 2017-SGR-1328), by the Gobierno de Aragón (E45_20R T58_20R research groups), and by Lenovo-BSC Contract-Framework Contract (2020). Santiago Marco was supported by the Agencia Estatal de Investigación (Spain) under Juan de la Cierva fellowship grant IJC2020-045916-I. Miquel Moretó was partially supported by the Agencia Estatal de Investigación (Spain) under Ramón y Cajal fellowship number RYC-2016-21104. Carl Christian Kjelgaard Mikkelsen is supported by eSSENCE, a collaborative e-Science programme funded by the Swedish Research Council within the framework of the strategic research areas designated by the Swedish Government., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

RISC-V for genome data analysis: opportunities and challenges

  • López Villellas, Lorien
  • Pineda Sánchez, Esteve
  • Badouh, Asaf
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Ibáñez Marín, Pablo
  • Alastruey Benedé, Jesús
  • Moretó Planas, Miquel|||0000-0002-9848-8758
The RISC-V ISA has gained significant momentum in High-Performance Computing (HPC) research and market due to its open-source nature, fostering collaborative research and innovation. The ever-growing RISC-V-based hardware/software ecosystem has made it an attractive option for HPC application development and production. Within the field of biomedical research, genome data analysis has emerged as a crucial step towards personalized medicine, demanding substantial computational resources and more efficient tools.This paper presents a benchmark suite of genome analysis kernels ported to RISC-V and their evaluation on modern RISC-V systems. Our work evaluates the RISC-V toolchain’s maturity and the software/hardware ecosystem’s readiness for its adoption for genome data analysis. This study aims to provide valuable guidance for researchers and practitioners interested in adopting RISC-V for genome analysis, and provides feedback to the RISC-V community on the challenges that need to be addressed for RISC-V to become an efficient HPC platform., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, and TED2021-132634A-I00), by the Generalitat de Catalunya (contract 2021-SGR-763), by the Gobierno de Aragon (T58_23R research group), by the European Union NextGenerationEU/PRTR, and by Lenovo-BSC Contract-Framework Contract (2020)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

L2C2: Last-level compressed-contents non-volatile cache and a procedure to forecast performance and lifetime

  • Escuín Blasco, Carlos
  • Ibáñez Marín, Pablo
  • Navarro, Denis
  • Monreal Arnal, Teresa|||0000-0002-0458-2234
  • Llaberia Griñó, José M.|||0000-0002-3753-4108
  • Viñals Yúfera, Victor
Several emerging non-volatile (NV) memory technologies are rising as interesting alternatives to build the Last-Level Cache (LLC). Their advantages, compared to SRAM memory, are higher density and lower static power, but write operations wear out the bitcells to the point of eventually losing their storage capacity. In this context, this paper presents a novel LLC organization designed to extend the lifetime of the NV data array and a procedure to forecast in detail the capacity and performance of such an NV-LLC over its lifetime. From a methodological point of view, although different approaches are used in the literature to analyze the degradation of an NV-LLC, none of them allows to study in detail its temporal evolution. In this sense, this work proposes a forecasting procedure that combines detailed simulation and prediction, allowing an accurate analysis of the impact of different cache control policies and mechanisms (replacement, wear-leveling, compression, etc.) on the temporal evolution of the indices of interest, such as the effective capacity of the NV-LLC or the system IPC. We also introduce L2C2, a LLC design intended for implementation in NV memory technology that combines fault tolerance, compression, and internal write wear leveling for the first time. Compression is not used to store more blocks and increase the hit rate, but to reduce the write rate and increase the lifetime during which the cache supports near-peak performance. In addition, to support byte loss without performance drop, L2C2 inherently allows N redundant bytes to be added to each cache entry. Thus, L2C2+N, the endurance-scaled version of L2C2, allows balancing the cost of redundant capacity with the benefit of longer lifetime. For instance, as a use case, we have implemented the L2C2 cache with STT-RAM technology. It has affordable hardware overheads compared to that of a baseline NV-LLC without compression in terms of area, latency and energy consumption, and increases up to 6-37 times the time in which 50% of the effective capacity is degraded, depending on the variability in the manufacturing process. Compared to L2C2, L2C2+6 which adds 6 bytes of redundant capacity per entry, that means 9.1% of storage overhead, can increase up to 1.4-4.3 times the time in which the system gets its initial peak performance degraded., All authors acknowledge support in part from grants (1) PID2019-105660RB-C21, PID2019-107255GB-C22, PID2019-103939RB-I00, or PDC2021-120898-I00 from Agencia Estatal de Investigación (AEI, https://www.aei.gob.es/) and Ministerio de Ciencia e Innovación (MCIN, https://www.ciencia.gob.es), (2) gaZ: T5820R research group from Aragón Goverment (http://www.aragon.es), (3) EU through FEDER and NextGenerationEU/PRTR programs by the DGA-FSE, and (4) by ISCIII under Project PI21/00440., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Compression-aware and performance-efficient insertion policies for long-lasting hybrid LLCs

  • Escuín Blasco, Carlos
  • Ali Khan, Asif
  • Ibáñez, Pablo Enrique
  • Monreal Arnal, Teresa|||0000-0002-0458-2234
  • Castrillón, Jerónimo
  • Viñals Yúfera, Victor
Emerging non-volatile memory (NVM) technologies can potentially replace large SRAM memories such as the last-level cache (LLC). However, despite recent advances, NVMs suffer from higher write latency and limited write endurance. Recently, NVM-SRAM hybrid LLCs are proposed to combine the best of both worlds. Several policies have been proposed to improve the performance and lifetime of hybrid LLCs by intelligently steering the incoming LLC blocks into either the SRAM or NVM part, regarding the cache behavior of the LLC blocks and the SRAM/NVM device properties. However, these policies neither consider compressing the contents of the cache block nor using partially worn-out NVM cache blocks.This paper proposes new insertion policies for byte-level fault-tolerant hybrid LLCs that collaboratively optimize for lifetime and performance. Specifically, we leverage data compression to utilize partially defective NVM cache entries, thereby improving the LLC hit rate. The key to our approach is to guide the insertion policy by both the reuse properties of the block and the size resulting from its compression. A block is inserted in NVM only if it is a read-reuse block or its compressed size is lower than a threshold. It will be inserted in SRAM if the block is a write-reuse or its compressed size is greater than the threshold. We use set-dueling to tune the compression threshold at runtime. This compression threshold provides a knob to control the NVM write rate and, together with a rule-based mechanism, allows balancing performance and lifetime.Overall, our evaluation shows that, with affordable hardware overheads, the proposed schemes can nearly reach the performance of an SRAM cache with the same associativity while improving lifetime by 17× compared to a hybrid NVM-unaware LLC. Our proposed scheme outperforms the state-of-the-art insertion policies by 9% while achieving a comparative lifetime. The rule-based mechanism shows that by compromising, for instance, 1.1% and 1.9% performance, the NVM lifetime can be further increased by 28% and 44%, respectively., This work was partially funded by the HiPEAC collaboration grant 2020, the Center for Advancing Electronics Dresden (cfaed), the German Research Council (DFG) through the HetCIM project (502388442) under the Priority Program on ‘Disruptive Memory Technologies’ (SPP 2377), and from grants (1) PID2019-105660RB-C21 and PID2019-107255GB- C22/AEI/10.13039/501100011033 from Agencia Estatal de Investigación (AEI), and (2) gaZ: T5820R research group from Dept. of Science, University and Knowledge Society, Government of Aragon., Peer Reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Expanding the Limits of Computer-Assisted Sperm Analysis through the Development of Open Software

  • Yaniz, J.
  • Alquezar-Baeta, C.
  • Yague-Martinez, J.
  • Alastruey-Benede, J.
  • Palacin, I.
  • Boryshpolets, S.
  • Kholodnyy, V.
  • Gadelha, H.
  • Perez-Pe, R.
Computer assisted sperm analysis (CASA) systems can reduce errors occurring in manual analysis. However, commercial CASA systems are frequently not applicable at the forefront of challenging research endeavors. The development of open source software may offer important solutions for researchers working in related areas. Here, we present an example of this, with the development of three new modules for the OpenCASA software (hosted at Github). The first is theChemotactic Sperm Accumulation Module, a powerful tool for studying sperm chemotactic behavior, analyzing the sperm accumulation in the direct vicinity of the stimuli. This module was validated by comparing fish sperm accumulation, with or without the influence of an attractant. The analysis clearly indicated cell accumulation in the treatment group, while the distribution of sperm was random in the control group. The second is the Sperm Functionality Module, based on the ability to recognize five sperm subpopulations according to their fluorescence patterns associated with the plasma membrane and acrosomal status. The last module is the Sperm Concentration Module, which expands the utilities of OpenCASA. These last two modules were validated, using bull sperm, by comparing them with visual counting by an observer. A high level of correlation was achieved in almost all the data, and a good agreement between both methods was obtained. With these newly developed modules, OpenCASA is consolidated as a powerful free and open-source tool that allowsdifferent aspects of sperm quality to be evaluated, with many potential applications for researchers.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

DC-Patch: A Microarchitectural Fault Patching Technique for GPU Register Files

  • Valero, A.
  • Suarez-Gracia, D.
  • Gran-Tejero, R.
The ever-increasing parallelism demand of General-Purpose Graphics Processing Unit (GPGPU) applications pushes toward larger and more energy-hungry register files in successive GPU generations. Reducing the supply voltage beyond its safe limit is an effective way to improve the energy efficiency of register files. However, at these operating voltages, the reliability of the circuit is compromised. This work aims to tolerate permanent faults from process variations in large GPU register files operating below the safe supply voltage limit. To do so, this paper proposes a microarchitectural patching technique, DC-Patch, exploiting the inherent data redundancy of applications to compress registers at run-time with neither compiler assistance nor instruction set modifications. Instead of disabling an entire faulty register file entry, DC-Patch leverages the reliable cells within a faulty entry to store compressed register values. Experimental results show that, with more than a third of faulty register entries, DC-Patch ensures a reliable operation of the register file and reduces the energy consumption by 47% with respect to a conventional register file working at nominal supply voltage. The energy savings are 21% compared to a voltage noise smoothing scheme operating at the safe supply voltage limit. These benefits are obtained with less than 2 and 6% impact on the system performance and area, respectively.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Automatic Safe Data Reuse Detection for the WCET Analysis of Systems With Data Caches

  • Segarra, J.
  • Cortadella, J.
  • Gran Tejero, R.
  • Viñals-Yufera, V.
Worst-case execution time (WCET) analysis of systems with data caches is one of the key challenges in real-time systems. Caches exploit the inherent reuse properties of programs, temporarily storing certain memory contents near the processor, in order that further accesses to such contents do not require costly memory transfers. Current worst-case data cache analysis methods focus on specific cache organizations (LRU, locked, ACDC, etc.). In this article, we analyze data reuse (in the worst case) as a property of the program, and thus independent of the data cache. Our analysis method uses Abstract Interpretation on the compiled program to extract, for each static load/store instruction, a linear expression for the address pattern of its data accesses, according to the Loop Nest Data Reuse Theory. Each data access expression is compared to that of prior (dominant) memory instructions to verify whether it presents a guaranteed reuse. Our proposal manages references to scalars, arrays, and non-linear accesses, provides both temporal and spatial reuse information, and does not require the exploration of explicit data access sequences. As a proof of concept we analyze the TACLeBench benchmark suite, showing that most loads/stores present data reuse, and how compiler optimizations affect it. Using a simple hit/miss estimation on our reuse results, the time devoted to data accesses in the worst case is reduced to 27% compared to an always-miss system, equivalent to a data hit ratio of 81%. With compiler optimization, such time is reduced to 6.5%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

FPGA accelerator for gradient boosting decision trees

  • Alcolea, A.
  • Resano, J.
A decision tree is a well-known machine learning technique. Recently their popularity has increased due to the powerful Gradient Boosting ensemble method that allows to gradually increasing accuracy at the cost of executing a large number of decision trees. In this paper we present an accelerator designed to optimize the execution of these trees while reducing the energy consumption. We have implemented it in an FPGA for embedded systems, and we have tested it with a relevant case-study: pixel classification of hyperspectral images. In our experiments with different images our accelerator can process the hyperspectral images at the same speed at which they are generated by the hyperspectral sensors. Compared to a high-performance processor running optimized software, on average our design is twice as fast and consumes 72 times less energy. Compared to an embedded processor, it is 30 times faster and consumes 23 times less energy.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Analysis of a Pipelined Architecture for Sparse DNNs on Embedded Systems

  • Alcolea Moreno, A.
  • Olivito, J.
  • Resano, J.
  • Mecha, H.
Deep neural networks (DNNs) are increasing their presence in a wide range of applications, and their computationally intensive and memory-demanding nature poses challenges, especially for embedded systems. Pruning techniques turn DNN models into sparse by setting most weights to zero, offering optimization opportunities if specific support is included. We propose a novel pipelined architecture for DNNs that avoids all useless operations during the inference process. It has been implemented in a field-programmable gate array (FPGA), and the performance, energy efficiency, and area have been characterized. Exploiting sparsity yields remarkable speedups but also produces area overheads. We have evaluated this tradeoff in order to identify in which scenarios it is better to use that area to exploit sparsity, or to include more computational resources in a conventional DNN architecture. We have also explored different arithmetic bitwidths. Our sparse architecture is clearly superior on 32-bit arithmetic or highly sparse networks. However, on 8-bit arithmetic or networks with low sparsity it is more profitable to deploy a dense architecture with more arithmetic resources than including support for sparsity. We consider that FPGAs are the natural target for DNN sparse accelerators since they can be loaded at run-time with the best-fitting accelerator.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Gender gap in STEM: a cross-sectional study of primary school students’ self-perception and test anxiety in mathematics

  • Ayuso, N.
  • Fillola, E.
  • Masiá, B.
  • Murillo, A.C.
  • Trillo, R.
  • Baldassarri, S.
  • Cerezo, E.
  • Ruberte, L.
  • Mariscal, M.D.
  • Villarroya, M.
Contribution: Significant gender differences are observed on primary school students’ perception of self-efficacy and test anxiety in mathematics. Girls perceive themselves to be significantly worse than boys in mathematics and report higher test anxiety toward mathematics exams. Gender differences in self-efficacy become more pronounced as students grow up, and test anxiety increases for all students. However, the present study shows that teachers’ do not perceive differences in self-efficacy in mathematics between boys and girls. Background: The low presence of women in science, technology, engineering, and mathematics (STEM) might be explained by the attitude of young students toward mathematics. Different studies show that girls are less interested in STEM areas than boys during secondary school. A study on the reasons for this fact pointed out that the early years of education can provide a relevant insight to reverse the situation. Research Questions: Is there any age-dependent gender difference in primary school students in aspects related to mathematics? Are teachers aware of students’ perceptions? Methodology: This work presents a study of over 2000 primary school students (6–12 years old) and 200 teachers in Aragón (Spain). The study consists of a survey on aspects that influence the experience of female and male students with mathematics and Spanish language for comparison purposes and teacher’s awareness of students’ perception. Findings: The present study shows that during primary school, girls are more likely to experiment a negative attitude toward mathematics than boys as they grow up, and teachers may not perceive girls’ situation. La baja presencia de mujeres en ciencia, tecnología, la ingeniería y las matemáticas (STEM) podrían explicarse por la actitud de las niños y niñas hacia las matemáticas. Diferentes estudios muestran que las niñas están menos interesadas en las áreas STEM que niños cuando cursan educación secundaria. Además, un estudio sobre los motivos para este hecho señaló que los primeros años de educación podrían proporcionar una visión relevante para revertir la situación. Por ello, este trabajo parte de las siguientes preguntas de investigación, ¿Existe alguna diferencia de género que sea dependiente de la edad en estudiantes de educación primaria en aspectos relacionados con las matemáticas? ¿Conoce el profesorado la autopercepción de sus estudiantes? Las principales contribuciones de este trabajo son que las diferencias significativas de género se observan en la percepción de autoeficacia de los estudiantes de primaria y ansiedad ante los exámenes en matemáticas. Las niñas se perciben a sí mismas significativamente peor que los niños en matemáticas e indican mayor ansiedad ante los exámenes de matemáticas. Las diferencias de género en la autoeficacia se vuelven más pronunciada a medida que los estudiantes crecen, mientras que la ansiedad ante los exámenes aumenta para todos los estudiantes. Pese a estos resultados, el presente estudio muestra que los profesores no perciben diferencias en la autoeficacia en matemáticas entre niños y niñas. Este estudio se basa en las encuestas realizadas a más de 2000 escolares (6-12 años) y 200 profesores en Aragón (España). El estudio consiste en una encuesta a los estudiantes sobre aspectos que pueden influir en la experiencia de los niños y niñas con las matemáticas, así como con la lengua española para disponer de una materia que permita establecer comparaciones y una encuesta al profesor que incluye cuestiones sobre su percepción de los estudiantes. El principal hallazgo del estudio es que, durante la escuela primaria, es más probable que las niñas experimenten una actitud negativa hacia matemáticas que los niños a medida que crecen, y que los maestros pueden no ser conscientes de la situación de las niñas.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Maximizing utilization and minimizing migration in thermal-aware energy-efficient real-time multiprocessor scheduling

  • Rubio-Anguiano, L.E.
  • Chils Trabanco, A.
  • Briz Velasco, J.L.
  • Ramírez-Trevino, A.
This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal and energy constraints. It calculates off-line a cyclic executive honoring temporal and thermal constraints, for a hard real-time (HRT) task set at minimum frequency to reduce consumed energy, minimizing context switches and migrations. It also provides an on-line controller able to manage system and task parametric variations and soft real-time (SRT) tasks, always meeting the HRT task set constraints and the system thermal bound. CAlECS maximizes CPU utilization to help avoid overprovisioning contributing to a low SWaP factor. Its modular design allows the utilization of different modeling and scheduling approaches, and makes the off-line and on-line components independent from each other to better suit the requirements of a specific system. We experimentally show that the cyclic executive provided by CAlECS for HRT task sets outperforms RUN, a reference off-line algorithm in terms of optimal number of context switches.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Developing an AI IoT application with open software on a RISC-V SoC

  • Torres-Sanchez, E.
  • Alastruey-Benede, J.
  • Torres-Moreno, E.
RISC-V is an emergent architecture that is gaining strength in low-power IoT applications. The stabilization of the architectural extensions and the start of commercialization of RISC-V based SOCs, like the Kendryte K210, raises the question of whether this open standard will facilitate the development of applications in specific markets or not.In this paper we evaluate the development environments, the toolchain, the debugging processes related to the Sipeed MAIX Go development board, as well as the standalone SDK and the Micropython port for the Kendryte K210. The training pipeline for the built-in convolutional neural network accelerator, with support for Tiny YOLO v2, has also been studied. In order to evaluate all the above aspects in depth, two low-cost, low-power, IoT edge applications based on AI have been developed. The first one is capable of recognizing movement in a house and autonomously identify whether it was caused by a human or by a house pet, like for example a dog or a cat. In the context of the current COVID-19 pandemic, the second application is capable of labeling whether a pedestrian is wearing a face mask or not, doing real-time object recognition at a mean rate of 13 FPS. Throughout the process, we can conclude that, despite the potential of the hardware and its excellent performance/cost ratio, the documentation for developers is scarce, the development environments are in low maturity levels, and the debugging processes are sometimes nonexistent.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Improving accuracy on wave height estimation through machine learning techniques

  • Gracia, S.
  • Olivito, J.
  • Resano, J.
  • Martin-del-Brio, B.
  • de Alfonso, M.
  • Álvarez, E.
Estimatabion of wave agitation plays a key role in predicting natural disasters, path optimization and secure harbor operation. The Spanish agency Puertos del Estado (PdE) has several oceanographic measure networks equipped with sensors for different physical variables, and manages forecast systems involving numerical models. In recent years, there is a growing interest in wave parameter estimation by using machine learning models due to the large amount of oceanographic data available for training, as well as its proven efficacy in estimating physical variables. In this study, we propose to use machine learning techniques to improve the accuracy of the current forecast system of PdE. We have focused on four physical wave variables: spectral significant height, mean spectral period, peak period and mean direction of origin. Two different machine learning models have been explored: multilayer perceptron and gradient boosting decision trees, as well as ensemble methods that combine both models. These models reduce the error of the predictions of the numerical model by 36% on average, demonstrating the potential gains of combining machine learning and numerical models.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Analytical Model for Memory-Centric High Level Synthesis-Generated Applications

  • Dávila-Guzmán, María Angélica
  • Gran Tejero, Rubén
  • Villarroya-Gaudó, María
  • Suárez Gracia, Darío
High performance computing (HPC) demands huge memory bandwidth and computing resources to achieve maximum performance and energy efficiency. FPGAs can provide both, and with the help of High Level Synthesis, those HPC applications can be easily written in high level languages. However, the optimization process remains time-consuming, especially when based on trial-and-error bitstream generation. Model-based performance prediction is a practical and fast approach for kernel optimization, specially if done with information from pre-synthesis reports. This article presents an analytical model focused on memory intensive applications that captures the memory behavior and accurately predicts the kernel execution time within seconds rather than hours, as bitstream generation requires. The model has been validated with two DRAM technologies: DDR4 and HBM2, with a set of microbenchmarks and high performance computing applications showing an average error of 11% for DDR4 and 10% for HBM2. Compared with previous studies, our predictions at least halve the estimation error.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A generic framework to integrate data caches in the WCET analysis of real-time systems

  • Segarra, Juan
  • Gran Tejero, Rubén
  • Viñals, Víctor
Worst-case execution time (WCET) analysis of systems with data caches is one of the key challenges in real-time systems. Caches exploit the inherent reuse properties of programs by temporarily storing certain memory contents near the processor, in order that further accesses to such contents do not require costly memory transfers. Current worst-case data cache analysis methods focus on specific cache organizations (set-associative LRU, locked, ACDC, etc.), most of the times adapting techniques designed to analyze instruction caches. On the other hand, there are methodologies to analyze the data reuse of a program, independently of the data cache. In this paper we propose a generic WCET analysis framework to analyze data caches taking profit of such reuse information. It includes the categorization of data references and their integration in an IPET model. We apply it to a conventional LRU cache, an ACDC, and other baseline systems, and compare them using the TACLeBench benchmark suite. Our results show that persistence-based LRU analyses dismiss essential information on data, and a reuse-based analysis improves the WCET bound around 17% in average. In general, the best WCET estimations are obtained with optimization level 2, where the ACDC cache performs 39% better than a set-associative LRU.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Misterio de los Letrabytes Fugados: Evaluación Inclusiva de la Conciencia Fonológica con Gamificación Tangible

  • Oliva, Ana
  • Ayuso, Natalia
  • Coma, Teresa
  • Torres, Enrique
The development of phonological awareness, i.e. the metacognitive skill that allows thinking and manipulating the language structure, from an early age is mandatory for the acquisition of literacy skills. Multisensory stimulation, curiosity and interest are fundamental for learning. In doing so, Communication Technologies have a key role because a learning-oriented use can encourage current digital natives' interest and thinking. This paper presents a game with tangible technology designed to both intervention and diagnostic, formative and summative evaluation. The user experience was carried out during two weeks through a multiple case study with four kindergarten children. A multimedia adventure game was presented in which they had to solve phonological awareness challenges through the manipulation of tangible technology to achieve the final goal. The observation was recorded in the designed evaluation model, allowing the analysis of pre- and post-intervention data after the triangulation of data for subsequent qualitative analysis. The results show an improvement in phonological awareness, as well as the gamified experience marks. These promising outcomes support the use of such methodologies to a learner-centered education model.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A cross-platform OpenVX library for FPGA accelerators

  • Davila-Guzman, M. A.
  • Kalms, L.
  • Gran Tejero, R.
  • Villarroya-Gaudo, M.
  • Suarez Gracia, D.
  • Göhringer, D.
FPGAs are an excellent platform to implement computer vision applications, since these applications tend to offer a high level of parallelism with many data-independent operations. However, the freedom in the solution design space of FPGAs represents a problem because each solution must be individually designed, verified, and tuned. The emergence of High Level Synthesis (HLS) helps solving this problem and has allowed the implementation of open programming standards as OpenVX for computer vision applications on FPGAs, such as the HiF1ipVX library developed exclusively for Xilinx devices. Although with the HiF1ipVX library, designers can develop solutions efficiently on Xilinx, they do not have an approach to port and run their code on FPGAs from other manufacturers. This work extends the HiFlipVX capabilities in two significant ways: supporting Intel FPGA devices and enabling execution on discrete FPGA accelerators. To provide both without affecting user-facing code, the new carried out implementation combines two HLS programming models: C++, using Intel''s system of tasks, and OpenCL, which provides the CPU interoperability. Comparing with pure OpenCL implementations, this work reduces kernel dispatch resources, saving up to 24% of ALUT resources for each kernel in a graph, and improves performance 2.6 x and energy consumption 1.6 x on average for a set of representative applications, compared with state-of-the-art frameworks.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A novel approach for adapting the standard addition method to single particle-ICP-MS for the accurate determination of NP size and number concentration in complex matrices; 35414390

  • Aramendía, M.
  • García-Mesa, J. C.
  • Alonso, E. V.
  • Garde, R.
  • Bazo, A.
  • Resano, J.
  • Resano, M.
This paper presents a novel approach, based on the standard addition method, for overcoming the matrix effects that often hamper the accurate characterization of nanoparticles (NPs) in complex samples via single particle inductively coupled plasma mass spectrometry (SP-ICP-MS). In this approach, calibration of the particle size is performed by two different methods: (i) by spiking a suspension of NPs standards of known size containing the analyte, or (ii) by spiking the sample with ionic standards; either way, the measured sensitivity is used in combination with the transport efficiency (TE) for sizing the NPs. Moreover, such transport efficiency can be readily obtained from the data obtained via both calibration methods mentioned above, so that the particle number concentration can also be determined. The addition of both ionic and NP standards can be performed on-line, by using a T-piece with two inlet lines of different dimensions. The smaller of the two is used for the standards, thus ensuring a constant and minimal sample dilution. As a result of the spiking of the samples, mixed histograms including the signal of the sample and that of the standards are obtained. However, the use of signal deconvolution approaches permits to extract the information, even in cases of signal populations overlapping. For proofing the concept, characterization of a 50 nm AuNPs suspension prepared in three different media (i.e., deionized water, 5% ethanol, and 2.5% tetramethyl ammonium hydroxide-TMAH) was carried out. Accurate results were obtained in all cases, in spite of the matrix effects detected in some media. Overall, the approach proposed offers flexibility, so it can be adapted to different situations, but it might be specially indicated for samples for which the matrix is not fully known and/or dilution is not possible/recommended. © 2022 The Authors
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Gated-CNN: Combating NBTI and HCI aging effects in on-chip activation memories of Convolutional Neural Network accelerators

  • Landeros Muñoz, N.
  • Valero, A.
  • Gran Tejero, R.
  • Zoni, D.
Negative Bias Temperature Instability (NBTI) and Hot Carrier Injection (HCI) are two of the main reliability threats in current technology nodes. These aging phenomena degrade the transistor''s threshold voltage (Vth) over the lifetime of a digital circuit, resulting in slower transistors that eventually lead to a faulty operation when the critical paths become longer than the processor cycle time. Among all the transistors on a chip, the most vulnerable transistors to such wearout effects are those used to implement SRAM storage, since memory cells are continuously degrading. In particular, NBTI ages PMOS cell transistors when a given logic value is stored for a long period (i.e., a long duty cycle), whereas HCI ages NMOS cell transistors not only when the stored value flips but also when it is accessed. This work focuses on mitigating aging in the on-chip SRAM memories of Convolutional Neural Network (CNN) accelerators storing activations. This paper makes two main contributions. At the software level, we quantify the aging induced by current CNN benchmarks with a characterization study of duty cycle, flip, and access patterns in every activation memory cell. Based on the insights from this study, this work proposes a novel microarchitectural technique, Gated-CNN, that ensures a uniform aging degradation of every memory cell. To do so, Gated-CNN exploits power-gating and address rotation techniques tailored to the memory demands and temporal/spatial localities exhibited by CNN applications, as well as the memory organization and management of CNN accelerators. Experimental results show that, compared to a conventional design, the average Vth degradation savings are at least as much as 49% depending on the type of transistor.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accounting for preemption and migration costs in the calculation of hard real-time cyclic executives for MPSoCs

  • Rubio-Anguiano, L.
  • Briz, J. L.
  • Ramirez-Trevino, A.
This work introduces a methodology to consider preemption and migration overhead in hard real-time cyclic executives on multicore architectures. The approach performs two iterative stages. The first stage takes a cyclic executive, from which the number and timing of all preemptions and migrations for every task is known. Then, it includes this overhead by updating the worst-case execution time (WCET) of the tasks. The second stage calculates a new cyclic executive considering the new WCET of tasks. The stages iterate until the preemption and migration overhead keeps constant. © 2016 IEEE.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

GPU-friendly neural networks for remote sensing scene classification

  • Haut, Juan M.
  • Alcolea, Adrian
  • Paoletti, Mercedes E.
  • Plaza, Javier
  • Resano, Javier
  • Plaza, Antonio
Convolutional neural networks (CNNs) have proven to be very efficient for the analysis of remote sensing (RS) images. Due to the inherent complexity of extracting features from these images, along with the increasing amount of data to be processed (and the diversity of applications), there is a clear tendency to develop and employ increasingly deep and complex CNNs. In this regard, graphics processing units (GPUs) are frequently used to optimize their execution, both for the training and inference stages, optimizing the performance of neural models through their many-core architecture. Hence, the efficient use of the GPU resources should be at the core of optimizations. This letter analyzes the possibilities of using a new family of CNNs, denoted as TResNets, to provide an efficient solution to the RS scene classification problem. Moreover, the considered models have been combined with mixed precision to enhance their training performance. Our experimental results, conducted over three publicly available RS data sets, show that the proposed networks achieve better accuracy and more efficient use of GPU resources than other state-of-the-art networks. Source code is available at https://github.com/mhaut/GPUfriendlyRS.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Berti: an Accurate Local-Delta Data Prefetcher

  • Navarro-Torres, Agustin
  • Panda, Biswabandan
  • Alastruey-Benede, Jesus
  • Ibañez, Pablo
  • Viñals-Yufera, Victor
  • Ros, Alberto
Data prefetching is a technique that plays a crucial role in modern high-performance processors by hiding long latency memory accesses. Several state-of-the-art hardware prefetchers exploit the concept of deltas, defined as the difference between the cache line addresses of two demand accesses. Existing delta prefetchers, such as best offset prefetching (BOP) and multi-lookahead prefetching (MLOP), train and predict future accesses based on global deltas. We observed that the use of global deltas results in missed opportunities to anticipate memory accesses. In this paper, we propose Berti, a first-level data cache prefetcher that selects the best local deltas, i.e., those that consider only demand accesses issued by the same instruction. Thanks to a high-confidence mechanism that precisely detects the timely local deltas with high coverage, Berti generates accurate prefetch requests. Then, it orchestrates the prefetch requests to the memory hierarchy, using the selected deltas. Our empirical results using ChampSim and SPEC CPU2017 and GAP workloads show that, with a storage overhead of just 2.55 KB, Berti improves performance by 8.5% compared to a baseline IP-stride and 3.5% compared to IPCP, a state-of-the-art prefetcher. Our evaluation also shows that Berti reduces dynamic energy at the memory hierarchy by 33.6% compared to IPCP, thanks to its high prefetch accuracy.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Bayesian neural networks to analyze hyperspectral datasets using uncertainty metrics

  • Alcolea, Adrián
  • Resano, Javier
Machine learning techniques, and specifically neural networks, have proved to be very useful tools for image classification tasks. Nevertheless, measuring the reliability of these networks and calibrating them accurately are very complex. This is even more complex in a field like hyperspectral imaging, where labeled data are scarce and difficult to generate. Bayesian neural networks (BNNs) allow to obtain uncertainty metrics related to the data processed (aleatoric), and to the uncertainty generated by the model selected (epistemic). On this work, we will demonstrate the utility of BNNs by analyzing the uncertainty metrics obtained by a BNN over five of the most used hyperspectral images datasets. In addition, we will illustrate how these metrics can be used for several practical applications such as identifying predictions that do not reach the required level of accuracy, detecting mislabeling in the dataset, or identifying when the predictions are affected by the increase of the level of noise in the input data.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Cu fractionation, isotopic analysis, and data processing via machine learning: new approaches for the diagnosis and follow up of Wilson's disease via ICP-MS

  • García-Poyo, M. Carmen
  • Bérail, Sylvain
  • Ronzani, Anne Laure
  • Rello, Luis
  • García-González, Elena
  • Nakadi, Flávio V.
  • Aramendía, Maite
  • Resano, Javier
  • Resano, Martín
  • Pécheyran, Christophe
Information about Cu fractionation and Cu isotopic composition can be paramount when investigating Wilson's disease (WD). This information can provide a better understanding of the metabolism of Cu. Most importantly, it may provide an easy way to diagnose and to follow the evolution of WD patients. For such purposes, protocols for Cu determination and Cu isotopic analysis via inductively coupled plasma mass spectrometry were investigated in this work, both in bulk serum and in the exchangeable copper (CuEXC) fractions. The CuEXC protocol provided satisfactory recovery values. Also, no significant mass fractionation during the whole analytical procedure (CuEXC production and/or Cu isolation) was detected. Analyses were carried out in controls (healthy persons), newborns, patients with hepatic disorders, and WD patients. While the results for Cu isotopic analysis are relevant (e.g., δ65Cu values were lower for both WD patients under chelating treatment and patients with hepatic problems in comparison with those values obtained for WD patients under Zn treatments, controls, and newborns) to comprehend Cu metabolism and to follow up the disease, the parameter that can help to better discern between WD patients and the rest of the patients tested (non-WD) was found to be the REC (relative exchangeable Cu). In this study, all the WD patients showed a REC higher than 17%, while the rest showed lower values. However, since establishing a universal threshold is complicated, machine learning was investigated to produce a model that can differentiate between WD and non-WD samples with excellent results (100% accuracy, albeit for a limited sample set). Most importantly, unlike other ML approaches, our model can also provide an uncertainty metric to indicate the reliability of the prediction, overall opening new ways to diagnose WD.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Improving the configuration of the predictable ACDC data cache for real-time systems

  • Segarra, J.
  • Marti-Campoy, A.
In real-time systems, analyzing the worst-case execution time (WCET) of a task in the presence of data caches is hard. The ACDC is a data cache that provides predictability, facilitating WCET analysis. It works by granting data cache replacement permission to specific load/store instructions. Nonetheless, knowing how to select these instructions to minimize the WCET, i.e., configuring the ACDC, is not trivial. In this paper, we propose four new methods to configure the ACDC, and compare them with existing methods. Unlike those in previous studies, our proposed methods provide specific ACDC configurations for the different phases of a given task, instead of a single ACDC configuration per task. We evaluate the WCET bounds obtained when using different ACDC configuration methods on the TACLeBench benchmark suite. Our results show that the most complex benchmarks work better with multiple-content configurations, which indicates that realistic tasks may also benefit from this kind of configuration. The methods proposed in this study improve the WCET in more than 60% of cases, with an average WCET improvement of nearly 5% and up to 50% in some cases.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Balancer: bandwidth allocation and cache partitioning for multicore processors

  • Navarro-Torres, Agustín
  • Alastruey-Benedé, Jesús
  • Ibáñez, Pablo
  • Viñals-Yúfera, Víctor
The management of shared resources in multicore processors is an open problem due to the continuous evolution of these systems. The trend toward increasing the number of cores and organizing them in clusters sets out new challenges not considered in previous works. In this paper, we characterize the use of the shared cache and memory bandwidth of an AMD Rome processor executing multiprogrammed workloads and propose several mechanisms that control the use of these resources to improve the system performance and fairness. Our control mechanisms require no hardware or operating system modifications. We evaluate Balancer on a real system running SPEC CPU2006 and CPU2017 applications. Balancer tuned for performance shows an average increase of 7.1% in system performance and an unfairness reduction of 18.6% with respect to a system without any control mechanism. Balancer tuned for fairness decreases the performance by 1.3% in exchange for a 64.5% reduction of unfairness.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

L2C2: Last-level compressed-contents non-volatile cache and a procedure to forecast performance and lifetime

  • Escuin, Carlos
  • Ibáñez, Pablo
  • Navarro, Denis
  • Monreal, Teresa
  • Llabería, José M.
  • Viñals, Víctor
Several emerging non-volatile (NV) memory technologies are rising as interesting alternatives to build the Last-Level Cache (LLC). Their advantages, compared to SRAM memory, are higher density and lower static power, but write operations wear out the bitcells to the point of eventually losing their storage capacity. In this context, this paper presents a novel LLC organization designed to extend the lifetime of the NV data array and a procedure to forecast in detail the capacity and performance of such an NV-LLC over its lifetime. From a methodological point of view, although different approaches are used in the literature to analyze the degradation of an NV-LLC, none of them allows to study in detail its temporal evolution. In this sense, this work proposes a forecasting procedure that combines detailed simulation and prediction, allowing an accurate analysis of the impact of different cache control policies and mechanisms (replacement, wear-leveling, compression, etc.) on the temporal evolution of the indices of interest, such as the effective capacity of the NV-LLC or the system IPC. We also introduce L2C2, a LLC design intended for implementation in NV memory technology that combines fault tolerance, compression, and internal write wear leveling for the first time. Compression is not used to store more blocks and increase the hit rate, but to reduce the write rate and increase the lifetime during which the cache supports near-peak performance. In addition, to support byte loss without performance drop, L2C2 inherently allows N redundant bytes to be added to each cache entry. Thus, L2C2+N, the endurance-scaled version of L2C2, allows balancing the cost of redundant capacity with the benefit of longer lifetime. For instance, as a use case, we have implemented the L2C2 cache with STT-RAM technology. It has affordable hardware overheads compared to that of a baseline NV-LLC without compression in terms of area, latency and energy consumption, and increases up to 6-37 times the time in which 50% of the effective capacity is degraded, depending on the variability in the manufacturing process. Compared to L2C2, L2C2+6 which adds 6 bytes of redundant capacity per entry, that means 9.1% of storage overhead, can increase up to 1.4-4.3 times the time in which the system gets its initial peak performance degraded.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate and efficient constrained molecular dynamics of polymers using Newton's method and special purpose code

  • López-Villellas, L.
  • Kjelgaard Mikkelsen C. Ch.
  • Galano-Frutos, J. J.
  • Marco-Sola, S.
  • Alastruey-Benedé, J.
  • Ibáñez, P.
  • Moretó, M.
  • Sancho, J.
  • García-Risueño, P.
In molecular dynamics simulations we can often increase the time step by imposing constraints on bond lengths and bond angles. This allows us to extend the length of the time interval and therefore the range of physical phenomena that we can afford to simulate. We examine the existing algorithms and software for solving nonlinear constraint equations in parallel and we explain why it is necessary to advance the state-of-the-art. We present ILVES-PC, a new algorithm for imposing bond constraints on proteins accurately and efficiently. It solves the same system of differential algebraic equations as the celebrated SHAKE algorithm, but ILVES-PC solves the nonlinear constraint equations using Newton’s method rather than the nonlinear Gauss-Seidel method. Moreover, ILVES-PC solves the necessary linear systems using a specialized linear solver that exploits the structure of the protein. ILVES-PC can rapidly solve constraint equations as accurately as the hardware will allow. The run-time of ILVES-PC is proportional to the number of constraints. We have integrated ILVES-PC into GROMACS and simulated proteins of different sizes. Compared with SHAKE, we have achieved speedups of up to 4.9× in single-threaded executions and up to 76× in shared-memory multi-threaded executions. Moreover, ILVES-PC is more accurate than P-LINCS algorithm. Our work is a proof-of-concept of the utility of software designed specifically for the simulation of polymers.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Porting and optimizing BWA-MEM2 using the Fujitsu A64FX processor

  • Langarita, Rubén
  • Armejach, Adrià
  • Ibáñez, Pablo
  • Alastruey-Benedé, Jesús
  • Moretó, Miquel
Sequence alignment pipelines for human genomes are an emerging workload that will dominate in the precision medicine field. BWA-MEM2 is a tool widely used in the scientific community to perform read mapping studies. In this paper, we port BWA-MEM2 to the AArch64 architecture using the ARMv8-A specification, and we compare the resulting version against an Intel Skylake system both in performance and in energy-to-solution. The porting effort entails numerous code modifications, since BWA-MEM2 implements certain kernels using x86 64 specific intrinsics, e.g., AVX-512. To adapt this code we use the recently introduced Arm’s Scalable Vector Extensions (SVE). More specifically, we use Fujitsu’s A64FX processor, the first to implement SVE. The A64FX powers the Fugaku Supercomputer that led the Top500 ranking from June 2020 to November 2021. After porting BWA-MEM2 we define and implement a number of optimizations to improve performance in the A64FX target architecture. We show that while the A64FX performance is lower than that of the Skylake system, A64FX delivers 11.6% better energy-to-solution on average. All the code used for this article is available at https://gitlab.bsc.es/rlangari/bwa-a64fx.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A learning experience toward the understanding of abstraction-level interactions in parallel applications

  • Valero, Alejandro
  • Gran-Tejero, Rubén
  • Suárez-Gracia, Darío
  • Georgescu, Emanue A.
  • Ezpeleta, Joaquín
  • Álvarez, Pedro
  • Muñoz, Adolfo
  • Ramos, Luis M.
  • Ibáñez, Pablo
In the curriculum of a Computer Engineering program, concepts like parallelism, concurrency, consistency, or atomicity are usually addressed in separate courses due to their thoroughness and extension. Isolating such concepts in courses helps students not only to focus on specific aspects, but also to experience the reality of working with modern computer systems, where those concepts are often detached in different abstraction levels. However, due to such an isolation, it exists a risk of inducing to the students an absence of interactions between these concepts, and, by extension, between the different abstraction levels of a system. This paper proposes a learning experience showcasing the interactions between abstraction levels addressed in laboratory sessions of different courses. The driving example is a parallel ray tracer. In the different courses, students implement and assemble components of this application from the algorithmic level of the tracer to the assembly instructions required to guarantee atomicity. Each lab focuses on a single abstraction level, but shows students the interactions with the rest of the levels. Technical results and student learning outcomes through the analysis of surveys validate the proposed experience and confirm the students learning improvement with a more integrated view of the system.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Contribución de congreso (ConferenceOutput)

PeRISCVcope: a tiny teaching-oriented RISC-V interpreter

  • Suárez Gracia, D.
  • Valero, A.
  • Gran Tejero, R.
  • Villarroya, M.
  • Viñals, V.
The fast advances of computer systems translate into a growing demand of methodologies and tools to introduce those novelties into classes. Among the plethora of those advances, virtualization has become an essential technology in almost every relevant system stack, from connected cars to hyperscaled cloud servers. However, introducing those technologies into the classroom remains a challenging task because of the huge complexity of their software components that may hinder the learning process of students. peRISCVcope aims to help in this area by proposing a tiny yet powerful interpreter to dig into virtualization technologies, such as the implementation of trap&emulate hypervisors. With less than 2,000 lines of code, and thanks to the conciseness of the RV32I base instruction set of RISC-V, peRISCVcope enables students to make virtualization knowledge their own. This paper presents our experiences developing and testing a virtualization laboratory where students implement parts of an interpreter. After the practical experience, peRISCVcope has been proved as a useful pedagogical tool, and, most importantly, students have positively rated the experience.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Flip-and-Patch: A Fault-Tolerant Technique for On-Chip Memories of CNN Accelerators at Low Supply Voltage

  • Toca-Díaz, Yamilka
  • Hernández Palacios, Reynier
  • Gran Tejero, Rubén
  • Valero, Alejandro
Aggressively reducing the supply voltage () below the safe threshold voltage () can effectively lead to significant energy savings in digital circuits. However, operating at such low supply voltages poses challenges due to a high occurrence of permanent faults resulting from manufacturing process variations in current technology nodes. This work addresses the impact of permanent faults on the accuracy of a Convolutional Neural Network (CNN) inference accelerator using on-chip activation memories supplied at low below Based on a characterization study of fault patterns, this paper proposes two low-cost microarchitectural techniques, namely Flip-and-Patch, which maintain the original accuracy of CNN applications even in the presence of a high number of faults caused by operating at. Unlike existing techniques, Flip-and-Patch remains transparent to the programmer and does not rely on application characteristics, making it easily applicable to real CNN accelerators. Experimental results show that Flip-and-Patch ensures the original CNN accuracy with a minimal impact on system performance (less than 0.05% for every application), while achieving average energy savings of 10.5% and 46.6% in activation memories compared to a conventional accelerator operating at safe and nominal supply voltages, respectively. Compared to the state-of-the-art ThUnderVolt technique, which dynamically adjusts the supply voltage at run time and discarding any energy overhead for such an approach, the average energy savings are by 3.2%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

GenArchBench: A genomics benchmark suite for arm HPC processors

  • López-Villellas, Lorién
  • Langarita-Benítez, Rubén
  • Badouh, Asaf
  • Soria-Pardos, Víctor
  • Aguado-Puig, Quim
  • López-Paradís, Guillem
  • Doblas, Max
  • Setoain, Javier
  • Kim, Chulho
  • Ono, Makoto
  • Armejach, Adrià
  • Marco-Sola, Santiago
  • Alastruey-Benedé, Jesús
  • Ibáñez, Pablo
  • Moretó, Miquel
Arm usage has substantially grown in the High-Performance Computing (HPC) community. Japanese supercomputer Fugaku, powered by Arm-based A64FX processors, held the top position on the Top500 list between June 2020 and June 2022, currently sitting in the fourth position. The recently released 7th generation of Amazon EC2 instances for compute-intensive workloads (C7 g) is also powered by Arm Graviton3 processors. Projects like European Mont-Blanc and U.S. DOE/NNSA Astra are further examples of Arm irruption in HPC. In parallel, over the last decade, the rapid improvement of genomic sequencing technologies and the exponential growth of sequencing data has placed a significant bottleneck on the computational side. While most genomics applications have been thoroughly tested and optimized for x86 systems, just a few are prepared to perform efficiently on Arm machines. Moreover, these applications do not exploit the newly introduced Scalable Vector Extensions (SVE). This paper presents GenArchBench, the first genome analysis benchmark suite targeting Arm architectures. We have selected computationally demanding kernels from the most widely used tools in genome data analysis and ported them to Arm-based A64FX and Graviton3 processors. Overall, the GenArch benchmark suite comprises 13 multi-core kernels from critical stages of widely-used genome analysis pipelines, including base-calling, read mapping, variant calling, and genome assembly. Our benchmark suite includes different input data sets per kernel (small and large), each with a corresponding regression test to verify the correctness of each execution automatically. Moreover, the porting features the usage of the novel Arm SVE instructions, algorithmic and code optimizations, and the exploitation of Arm-optimized libraries. We present the optimizations implemented in each kernel and a detailed performance evaluation and comparison of their performance on four different HPC machines (i.e., A64FX, Graviton3, Intel Xeon Skylake Platinum, and AMD EPYC Rome). Overall, the experimental evaluation shows that Graviton3 outperforms other machines on average. Moreover, we observed that the performance of the A64FX is significantly constrained by its small memory hierarchy and latencies. Additionally, as proof of concept, we study the performance of a production-ready tool that exploits two of the ported and optimized genomic kernels.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Modeling Time-Sensitive Networking Using Timed Continuous Petri Nets

  • Torres-Macías, A.G.
  • Ramírez-Treviño, A.
  • Briz, J.L.
  • Segarra, J.
  • Blanco-Alcaine, H.
Time-Sensitive Networking (TSN) is a set of standards designed to provide determinism to Ethernet or wireless networks for real-time applications. Network Calculus (NC) is the best-known formal tool for TSN analysis, but it is hard to apply in scenarios of changing conditions. Petri Nets can potentially overcome some limitations of NC, but they have rarely been used as an analytical tool for TSN. This work presents a novel modeling methodology exploiting Timed Continuous Petri Nets (TCPNs) to abstract and analyze TSN nodes.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Compression-aware and performance-efficient insertion policies for long-lasting hybrid LLCs

  • Escuín Blasco, Carlos
  • Ali Khan, Asif
  • Ibáñez, Pablo Enrique
  • Monreal Arnal, Teresa
  • Castrillón, Jerónimo
  • Viñals Yúfera, Victor
Emerging non-volatile memory (NVM) technologies can potentially replace large SRAM memories such as the last-level cache (LLC). However, despite recent advances, NVMs suffer from higher write latency and limited write endurance. Recently, NVM-SRAM hybrid LLCs are proposed to combine the best of both worlds. Several policies have been proposed to improve the performance and lifetime of hybrid LLCs by intelligently steering the incoming LLC blocks into either the SRAM or NVM part, regarding the cache behavior of the LLC blocks and the SRAM/NVM device properties. However, these policies neither consider compressing the contents of the cache block nor using partially worn-out NVM cache blocks.This paper proposes new insertion policies for byte-level fault-tolerant hybrid LLCs that collaboratively optimize for lifetime and performance. Specifically, we leverage data compression to utilize partially defective NVM cache entries, thereby improving the LLC hit rate. The key to our approach is to guide the insertion policy by both the reuse properties of the block and the size resulting from its compression. A block is inserted in NVM only if it is a read-reuse block or its compressed size is lower than a threshold. It will be inserted in SRAM if the block is a write-reuse or its compressed size is greater than the threshold. We use set-dueling to tune the compression threshold at runtime. This compression threshold provides a knob to control the NVM write rate and, together with a rule-based mechanism, allows balancing performance and lifetime.Overall, our evaluation shows that, with affordable hardware overheads, the proposed schemes can nearly reach the performance of an SRAM cache with the same associativity while improving lifetime by 17× compared to a hybrid NVM-unaware LLC. Our proposed scheme outperforms the state-of-the-art insertion policies by 9% while achieving a comparative lifetime. The rule-based mechanism shows that by compromising, for instance, 1.1% and 1.9% performance, the NVM lifetime can be further increased by 28% and 44%, respectively., This work was partially funded by the HiPEAC collaboration grant 2020, the Center for Advancing Electronics Dresden (cfaed), the German Research Council (DFG) through the HetCIM project (502388442) under the Priority Program on ‘Disruptive Memory Technologies’ (SPP 2377), and from grants (1) PID2019-105660RB-C21 and PID2019-107255GB- C22/AEI/10.13039/501100011033 from Agencia Estatal de Investigación (AEI), and (2) gaZ: T5820R research group from Dept. of Science, University and Knowledge Society, Government of Aragon., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

OpenPiton optimizations towards high performance manycores

  • Leyva Santes, Neiel Israel
  • Monemi, Alireza
  • Oliete Escuín, Noelia
  • López Paradís, Guillem
  • Abancens Calvo, Xabier
  • Balkind, Jonathan
  • Vallejo Gutiérrez, Enrique
  • Moretó Planas, Miquel
  • Álvarez Martí, Lluc
In recent years, numerous multicore RISC-V platforms have emerged. Within the RISC-V ecosystem, Networks-on-Chip (NoCs) such as OpenPiton are employed in designs that aim to scale to a large number of cores. This paper presents a set of extensions and optimizations to OpenPiton for high-performance manycores. The key contributions are enabling multiple memory controllers, supporting router bypassing and NoC concentration, and adding support for configurable cache sizes and cache block sizes. On a 64-core manycore architecture, these new features and optimizations provide a geometric mean speedup of 6.5x compared to the OpenPiton baseline., This work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019- 107255GB-C21, PID2019-105660RB-C22 and TED2021-131176B-I00), by the Generalitat de Catalunya (contract 2021-SGR-00763), by the European Union within the framework of the ERDF of Catalonia 2014- 2020 under the DRAC project [001-P-001723] and by the European NextGenerationEU/PRTR, and by Lenovo-BSC Contract-Framework Contract (2022). The MEEP Project has received funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 946002. The JU receives support from the European Union’s Horizon 2020 research and innovation program and Spain, Croatia and Turkey. G. López-Paradís has been supported by the Generalitat de Catalunya through a FI fellowship 2021FI-B00994., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

RISC-V for genome data analysis: opportunities and challenges

  • López Villellas, Lorien
  • Pineda Sánchez, Esteve
  • Badouh, Asaf
  • Marco Sola, Santiago
  • Ibáñez Marín, Pablo
  • Alastruey Benedé, Jesús
  • Moretó Planas, Miquel
The RISC-V ISA has gained significant momentum in High-Performance Computing (HPC) research and market due to its open-source nature, fostering collaborative research and innovation. The ever-growing RISC-V-based hardware/software ecosystem has made it an attractive option for HPC application development and production. Within the field of biomedical research, genome data analysis has emerged as a crucial step towards personalized medicine, demanding substantial computational resources and more efficient tools.This paper presents a benchmark suite of genome analysis kernels ported to RISC-V and their evaluation on modern RISC-V systems. Our work evaluates the RISC-V toolchain’s maturity and the software/hardware ecosystem’s readiness for its adoption for genome data analysis. This study aims to provide valuable guidance for researchers and practitioners interested in adopting RISC-V for genome analysis, and provides feedback to the RISC-V community on the challenges that need to be addressed for RISC-V to become an efficient HPC platform., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, and TED2021-132634A-I00), by the Generalitat de Catalunya (contract 2021-SGR-763), by the Gobierno de Aragon (T58_23R research group), by the European Union NextGenerationEU/PRTR, and by Lenovo-BSC Contract-Framework Contract (2020)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

L2C2: Last-level compressed-contents non-volatile cache and a procedure to forecast performance and lifetime

  • Escuín Blasco, Carlos
  • Ibáñez Marín, Pablo
  • Navarro, Denis
  • Monreal Arnal, Teresa
  • Llaberia Griñó, José M.
  • Viñals Yúfera, Victor
Several emerging non-volatile (NV) memory technologies are rising as interesting alternatives to build the Last-Level Cache (LLC). Their advantages, compared to SRAM memory, are higher density and lower static power, but write operations wear out the bitcells to the point of eventually losing their storage capacity. In this context, this paper presents a novel LLC organization designed to extend the lifetime of the NV data array and a procedure to forecast in detail the capacity and performance of such an NV-LLC over its lifetime. From a methodological point of view, although different approaches are used in the literature to analyze the degradation of an NV-LLC, none of them allows to study in detail its temporal evolution. In this sense, this work proposes a forecasting procedure that combines detailed simulation and prediction, allowing an accurate analysis of the impact of different cache control policies and mechanisms (replacement, wear-leveling, compression, etc.) on the temporal evolution of the indices of interest, such as the effective capacity of the NV-LLC or the system IPC. We also introduce L2C2, a LLC design intended for implementation in NV memory technology that combines fault tolerance, compression, and internal write wear leveling for the first time. Compression is not used to store more blocks and increase the hit rate, but to reduce the write rate and increase the lifetime during which the cache supports near-peak performance. In addition, to support byte loss without performance drop, L2C2 inherently allows N redundant bytes to be added to each cache entry. Thus, L2C2+N, the endurance-scaled version of L2C2, allows balancing the cost of redundant capacity with the benefit of longer lifetime. For instance, as a use case, we have implemented the L2C2 cache with STT-RAM technology. It has affordable hardware overheads compared to that of a baseline NV-LLC without compression in terms of area, latency and energy consumption, and increases up to 6-37 times the time in which 50% of the effective capacity is degraded, depending on the variability in the manufacturing process. Compared to L2C2, L2C2+6 which adds 6 bytes of redundant capacity per entry, that means 9.1% of storage overhead, can increase up to 1.4-4.3 times the time in which the system gets its initial peak performance degraded., All authors acknowledge support in part from grants (1) PID2019-105660RB-C21, PID2019-107255GB-C22, PID2019-103939RB-I00, or PDC2021-120898-I00 from Agencia Estatal de Investigación (AEI, https://www.aei.gob.es/) and Ministerio de Ciencia e Innovación (MCIN, https://www.ciencia.gob.es), (2) gaZ: T5820R research group from Aragón Goverment (http://www.aragon.es), (3) EU through FEDER and NextGenerationEU/PRTR programs by the DGA-FSE, and (4) by ISCIII under Project PI21/00440., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

HyCSim: A rapid design space exploration tool for emerging hybrid last-level caches

  • Escuín Blasco, Carlos
  • Ali Khan, Asif
  • Ibáñez Marín, Pablo Enrique
  • Monreal Arnal, Teresa
  • Viñals Yúfera, Victor
  • Castrillón, Jerónimo
Recent years have seen a rising trend in the exploration of non-volatile memory (NVM) technologies in the memory subsystem. Particularly in the cache hierarchy, hybrid last-level cache (LLC) solutions are proposed to meet the wide-ranging performance and energy requirements of modern days applications. These emerging hybrid solutions need simulation and detailed exploration to fully understand their capabilities before exploiting them. Existing simulation tools are either too slow or incapable of prototyping such systems and optimizing for NVM devices. To this end, we propose HyCSim, a trace-driven simulation infrastructure that enables rapid comparison of various hybrid LLC configurations for different optimization objectives. Notably, HyCSim makes it possible to quickly estimate the impact of various hybrid LLC insertion and replacement policies, disabling of a cache region at byte or cache frame granularity for different fault maps. In addition, HyCSim allows to evaluate the impact of various compression schemes on the overall performance (hit and miss rate) and the number of writes to the LLC. Our evaluation on ten multi-program workloads from the SPEC 2006 benchmarks suite shows that HyCSim accelerates the simulation time by 24×, compared to the cycle-accurate Gem5 simulator, with high-fidelity., This work was partially funded by the HiPEAC collaboration grant 2020, the German Research Council (DFG) through the TraceSymm project (366764507) and the Co4RTM project (450944241), MCIN/AEI/10.13039/501100011033 (grants PID2019-105660RB-C21 and PID2019- 107255GB-C22), and by Aragón Government (T5820R research group)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Accurate and efficient constrained molecular dynamics of polymers using Newton's method and special purpose code

  • López Villellas, Lorién
  • Kjelgaard Mikkelsen, Carl Christian
  • Galano Frutos, Juan José
  • Marco Sola, Santiago
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo Enrique
  • Moretó Planas, Miquel
  • Sancho Sanz, Javier
  • García Risueño, Pablo
In molecular dynamics simulations we can often increase the time step by imposing constraints on bond lengths and bond angles. This allows us to extend the length of the time interval and therefore the range of physical phenomena that we can afford to simulate. We examine the existing algorithms and software for solving nonlinear constraint equations in parallel and we explain why it is necessary to advance the state-of-the-art. We present ILVES-PC, a new algorithm for imposing bond constraints on proteins accurately and efficiently. It solves the same system of differential algebraic equations as the celebrated SHAKE algorithm, but ILVES-PC solves the nonlinear constraint equations using Newton's method rather than the nonlinear Gauss-Seidel method. Moreover, ILVES-PC solves the necessary linear systems using a specialized linear solver that exploits the structure of the protein. ILVES-PC can rapidly solve constraint equations as accurately as the hardware will allow. The run-time of ILVES-PC is proportional to the number of constraints. We have integrated ILVES-PC into GROMACS and simulated proteins of different sizes. Compared with SHAKE, we have achieved speedups of up to 4.9× in single-threaded executions and up to 76× in shared-memory multi-threaded executions. Moreover, ILVES-PC is more accurate than P-LINCS algorithm. Our work is a proof-of-concept of the utility of software designed specifically for the simulation of polymers., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, and PID2019-107293GB-I00), by the Generalitat de Catalunya (contract 2017-SGR-1328), by the Gobierno de Aragón (E45_20R T58_20R research groups), and by Lenovo-BSC Contract-Framework Contract (2020). Santiago Marco was supported by the Agencia Estatal de Investigación (Spain) under Juan de la Cierva fellowship grant IJC2020-045916-I. Miquel Moretó was partially supported by the Agencia Estatal de Investigación (Spain) under Ramón y Cajal fellowship number RYC-2016-21104. Carl Christian Kjelgaard Mikkelsen is supported by eSSENCE, a collaborative e-Science programme funded by the Swedish Research Council within the framework of the strategic research areas designated by the Swedish Government., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

GenArchBench: A genomics benchmark suite for arm HPC processors

  • López Villellas, Lorien
  • Langarita Benítez, Rubén
  • Badouh, Asaf
  • Soria Pardos, Víctor
  • Aguado Puig, Quim
  • López Paradís, Guillem
  • Doblas Font, Max
  • Setoain, Javier
  • Kim, Chulho
  • Ono, Makoto
  • Armejach Sanosa, Adrià
  • Marco Sola, Santiago
  • Alastruey Benedé, Jesús
  • Ibáñez Marín, Pablo
  • Moretó Planas, Miquel
Arm usage has substantially grown in the High-Performance Computing (HPC) community. Japanese supercomputer Fugaku, powered by Arm-based A64FX processors, held the top position on the Top500 list between June 2020 and June 2022, currently sitting in the fourth position. The recently released 7th generation of Amazon EC2 instances for compute-intensive workloads (C7 g) is also powered by Arm Graviton3 processors. Projects like European Mont-Blanc and U.S. DOE/NNSA Astra are further examples of Arm irruption in HPC. In parallel, over the last decade, the rapid improvement of genomic sequencing technologies and the exponential growth of sequencing data has placed a significant bottleneck on the computational side. While most genomics applications have been thoroughly tested and optimized for x86 systems, just a few are prepared to perform efficiently on Arm machines. Moreover, these applications do not exploit the newly introduced Scalable Vector Extensions (SVE). This paper presents GenArchBench, the first genome analysis benchmark suite targeting Arm architectures. We have selected computationally demanding kernels from the most widely used tools in genome data analysis and ported them to Arm-based A64FX and Graviton3 processors. Overall, the GenArch benchmark suite comprises 13 multi-core kernels from critical stages of widely-used genome analysis pipelines, including base-calling, read mapping, variant calling, and genome assembly. Our benchmark suite includes different input data sets per kernel (small and large), each with a corresponding regression test to verify the correctness of each execution automatically. Moreover, the porting features the usage of the novel Arm SVE instructions, algorithmic and code optimizations, and the exploitation of Arm-optimized libraries. We present the optimizations implemented in each kernel and a detailed performance evaluation and comparison of their performance on four different HPC machines (i.e., A64FX, Graviton3, Intel Xeon Skylake Platinum, and AMD EPYC Rome). Overall, the experimental evaluation shows that Graviton3 outperforms other machines on average. Moreover, we observed that the performance of the A64FX is significantly constrained by its small memory hierarchy and latencies. Additionally, as proof of concept, we study the performance of a production-ready tool that exploits two of the ported and optimized genomic kernels., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21, PID2019-105660RB-C21, PID2022136454NB-C22, and TED2021-132634A-I00), by the Generalitat de Catalunya, Spain (contract 2021-SGR-763), by the Gobierno de Aragón (T58_23R research group), by the European Union NextGenerationEU/ PRTR, and by Lenovo BSC Contract-Framework Contract (2020)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Porting and optimizing BWA-MEM2 using the Fujitsu A64FX processor

  • Langarita Benítez, Rubén
  • Armejach Sanosa, Adrià
  • Ibáñez Marín, Pablo
  • Alastruey Benedé, Jesús
  • Moretó Planas, Miquel
Sequence alignment pipelines for human genomes are an emerging workload that will dominate in the precision medicine field. BWA-MEM2 is a tool widely used in the scientific community to perform read mapping studies. In this paper, we port BWA-MEM2 to the AArch64 architecture using the ARMv8-A specification, and we compare the resulting version against an Intel Skylake system both in performance and in energy-to-solution. The porting effort entails numerous code modifications, since BWA-MEM2 implements certain kernels using x86_64 specific intrinsics, e.g., AVX-512. To adapt this code we use the recently introduced Arm's Scalable Vector Extensions (SVE). More specifically, we use Fujitsu's A64FX processor, the first to implement SVE. The A64FX powers the Fugaku Supercomputer that led the Top500 ranking from June 2020 to November 2021. After porting BWA-MEM2 we define and implement a number of optimizations to improve performance in the A64FX target architecture. We show that while the A64FX performance is lower than that of the Skylake system, A64FX delivers 11.6% better energy-to-solution on average. All the code used for this article is available at https://gitlab.bsc.es/rlangari/bwa-a64fx, This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (contracts PID2019-107255GB-C21 / AEI /10.13039/501100011033 and PID2019-105660RB-C21 / AEI / 10.13039/501100011033), Gobierno de Aragon (T5820R research group), the Generalitat de Catalunya (contracts 2017-SGR-1328 and 2017-SGR1414), and the European Union’s Horizon 2020 research and innovation program (Mont-Blanc 2020 project, grant agreement 779877). Finally, A. Armejach and M. Moreto have been partially supported by the Spanish Ministry of Economy, Industry and Competitiveness under Juan de la Cierva fellowship no. IJCI-2017-33945 and Ramon y Cajal fellowship no. RYC-2016-21104, respectively., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Pronóstico de capacidad efectiva y prestaciones en una cache no volátil de último nivel

  • Escuín Blasco, Carlos
  • Monreal Arnal, Teresa
  • Llaberia Griñó, José M.
  • Ibáñez Marín, Pablo Enrique
  • Viñals Yúfera, Victor
La degradación debida a las escrituras que sufren las bitcells implementadas con tecnologi´as de memoria no volátil (NVM) es uno de los principales escollos que se presentan a la hora de construir la cache de último nivel (LLC) con estas tecnologi´as. Aunque en la literatura se recogen diferentes propuestas para hacer frente a esta degradación, la metodologi´a usada en los trabajos previos no permite estudiar en detalle la evolución de la capacidad efectiva ni de las prestaciones en una cache no volátil de último nivel (NV-LLC). Por ello, en este trabajo se propone un procedimiento de pronóstico que combina simulación y predicción con el objetivo de estudiar dicha evolución. Por otra parte, la compresión es una de las técnicas propuestas en la literatura para lidiar con la degradación de las memorias no volátiles. En primer lugar, la compresión diminuye la cantidad de información escrita en una NV-LLC. En segundo lugar, cuando los contenedores ven mermada su capacidad debido a la degradación, la compresión permite mantener su funcionalidad albergando bloques de tamaño reducido. El procedimiento de pronóstico desarrollado en este trabajo permite evaluar el impacto de diferentes técnicas y mecanismos de gestión de contenidos en la esperanza de vida y las prestaciones de una NV-LLC de manera detallada. El mecanismo de compresión adoptado en este trabajo multiplica hasta por 5 veces la esperanza de vida de una NV-LLC., Este trabajo ha sido financiado por MINECO/AEI/FEDER (UE) (proyectos PID2019-105660RB-C21 y PID2019-107255GB-C22 / AEI / 10.13039/501100011033), el Gobierno de Aragon (Grupo T58 20R) y FEDER 2014-2020 “Construyendo Europa desde Aragón”., Peer Reviewed, Postprint (published version)