Pasar al contenido principal

BSC - COMPUTACION DE ALTAS PRESTACIONES VIII

PID2019-107255GB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario BARCELONA SUPERCOMPUTING CENTER CENTRO NACIONAL DE SUPERCOMPUTACION

Resultados relacionados

Resultados totales (Incluyendo duplicados): 243
Encontrada(s) 3 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Punxa, A Python-Based RISC-V System Simulator for Education

  • Castells-Rufas, David|||0000-0002-7181-9705
  • Novo, David|||0000-0002-5510-4152
  • Martorell, Xavier|||0000-0002-0417-3430
The analysis and verification of the integration of hardware and software components is challenging. Traditional HDL simulators, which are often slow and provide low-level analysis tools, are not always effective for simulating the software of processor-based systems. This work presents an interactive co-simulation framework that enhances students' understanding of computer architecture concepts typically obscured by hardware intricacies. This framework facilitates a unified environment for iterative design, enabling detailed analysis and generation of reports and traces to identify system performance, bottlenecks, and find implementation errors. By prioritizing analysis features over performance, this framework serves as a valuable tool for educational purposes and comprehensive examination of the interactions between hardware and software.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

BIMSA, accelerating long sequence alignment using processing-in-memory

  • Alonso-Marín, Alejandro
  • Fernandez, Ivan
  • Aguado-Puig, Quim|||0000-0003-4871-3192
  • Gómez-Luna, Juan|||0000-0002-6514-1571
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Mutlu, Onur
  • Moreto, Miquel|||0000-0002-9848-8758
Recent advances in sequencing technologies have stressed the critical role of sequence analysis algorithms and tools in genomics and healthcare research. In particular, sequence alignment is a fundamental building block in many sequence analysis pipelines and is frequently a performance bottleneck both in terms of execution time and memory usage. Classical sequence alignment algorithms are based on dynamic programming and often require quadratic time and memory with respect to the sequence length. As a result, classical sequence alignment algorithms fail to scale with increasing sequence lengths and quickly become memory-bound due to data-movement penalties. Processing-In-Memory (PIM) is an emerging architectural paradigm that seeks to accelerate memory-bound algorithms by bringing computation closer to the data to mitigate data-movement penalties. This work presents BIMSA (idirectional n-emory equence lignment), a PIM design and implementation for the state-of-the-art sequence alignment algorithm BiWFA (Bidirectional Wavefront Alignment), incorporating new hardware-aware optimizations for a production-ready PIM architecture (UPMEM). BIMSA supports aligning sequences up to 100K bases, exceeding the limitations of state-of-the-art PIM implementations. First, BIMSA achieves speedups up to 22.24× (11.95× on average) compared to state-of-the-art PIM-enabled implementations of sequence alignment algorithms. Second, achieves speedups up to 5.84× (2.83× on average) compared to the highest-performance multicore CPU implementation of BiWFA. Third, BIMSA exhibits linear scalability with the number of compute units in memory, enabling further performance improvements with upcoming PIM architectures equipped with more compute units and achieving speedups up to 9.56× (4.7× on average).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Leveraging HLS to Design a Versatile &amp, High-Performance Classic McEliece Accelerator

  • Kostalabros, Ioannis-Vatistas
  • Ribes, Jordi
  • Carril, Xavier
  • Farràs, Oriol
  • Moreto, Miquel
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] By harnessing fundamental quantum properties, a large-scale quantum computer could undermine currently deployed public-key algorithms. The post-quantum, code-based cryptosystem Classic McEliece (CM)addresses this security concern. However, its large public key size (up to 1.3 MB) poses various hardware implementation challenges. In this article, we focus on the high memory bandwidth requirements of the CM encoding function, in the context of heterogeneous CPU-FPGA devices. More concretely, we target the acceleration of public-key loading and processing from any globally shared or accelerator-private memory system. We present a novel and constant-time accelerator eEnc that exploits the elevated parallelization potential of FPGA devices to yield high-performance results. Our accelerator implements the encoding and the random error vector generation functions, which comprise the main computational load of Encapsulation. Two accelerator design variants are introduced, providing different hardware tradeoffs. Regarding intra-accelerator data communication, and unlike other state-of-the-art (SOTA) works, we combine a streaming protocol with task-level parallelization to remove the need to store the public key in accelerator-private memories. Our proposed design shows new record execution times over its SOTA counterparts, ranging on average from 3.5x up to 7.7x across the five security level parameter sets. Our end-to-end implementation in a Zynq SoC shows an average speedup of 2.2x compared to a 64-bit vectorized CM software-baseline. The elevated logic resource consumption, characteristic of HLS designs, can be readily adjusted with a performance tradeoff., 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 ACITHEC PID2021-124928NB-I00, PID2019-107255GB-C21 and "Ramon y Cajal" fellowship No. RYC2020-030685-I) , by the Generalitat de Catalunya (contract 2021-SGR-00763, 2021-SGR-00115 and 2023-146511NB-I00) , by the Agency for Management of University and Research Grants (AGAUR) of the Government of Catalonia under "Ajuts per a la contractacio de personal investigador novell" (fellowships No. 2019FI B01274 and 2024 FI-1 00520) , by the European Union within the framework of the ERDF of Catalonia 2014-2020 under the DRAC project [001-P-001723] , and by the project HERMES funded by the European NextGenerationEU/PRTR via INCIBE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parallel reduced-order modeling for digital twins using high-performance computing workflows

  • Ares de Parga, S.
  • Bravo, J. R.
  • Sibuet, N.
  • Hernandez, J. A.
  • Rossi, R.
  • Boschert, Stefan
  • Tatu, Cristian Catalin
  • Vázquez-Novoa, Fernando
  • Ejarque, Jorge
  • Badia, Rosa M.
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Tomás Domínguez, Andrés Enrique
[EN] The integration of reduced-order models with high-performance computing is critical for developing digital twins, particularly for real-time monitoring and predictive maintenance of industrial systems. This paper presents a comprehensive, high-performance computing-enabled workflow for developing and deploying projection-based reduced-order models for large-scale mechanical simulations. We use PyCOMPSs' parallel framework to efficiently execute reduced-order model training simulations, employing parallel singular value decomposition algorithms such as randomized singular value decomposition, Lanczos singular value decomposition, and full singular value decomposition based on tall-skinny QR. Moreover, we introduce a partitioned version of the hyperreduction scheme known as the Empirical Cubature Method to further enhance computational efficiency in projection-based reduced-order models for mechanical systems. Despite the widespread use of high-performance computing for projection-based reduced-order models, there is a significant lack of publications detailing comprehensive workflows for building and deploying end-to-end projection-based reduced-order models in high-performance computing environments. Our workflow is validated through a case study focusing on the thermal dynamics of a motor, a multiphysics problem involving convective heat transfer and mechanical components. The projection-based reduced-order model is designed to deliver a real-time prognosis tool that could enable rapid and safe motor restarts post-emergency shutdowns under different operating conditions, demonstrating its potential impact on the practice of simulations in engineering mechanics. To facilitate deployment, we use the High-Performance Computing Workflow as a Service strategy and Functional Mock-Up Units to ensure compatibility and ease of integration across high-performance computing, edge, and cloud environments. The outcomes illustrate the efficacy of combining projection-based reduced-order models and high-performance computing, establishing a precedent for scalable, real-time digital twin applications in computational mechanics across multiple industries., The authors acknowledge financial support from the Spanish Ministry of Economy and Competitiveness, through the Severo Ochoa Programme for Centres of Excellence in R&D (CEX2018-000797-S and CEX2021-001148-S) , as well as to the project PID2019-107255GB (BSC authors). This project has received funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 955558. The JU receives support from the European Union s Horizon 2020 research and innovation programme and Spain, Germany, France, Italy, Poland, Switzerland, Norway. This publication is part of the R&D project PCI2021-121944 and PCI2021-121957, financed by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR . Sebastian Ares de Parga Regalado acknowledges financial support from the Generalitat de Catalunya through the FI_SDUR-2021 grant (2021 FISDU 00142), which provided funding for his predoctoral training. BSC authors acknowledge financial support from the Departament de Recerca i Universitats de la Generalitat de Catalunya, research group MPiEDist (2021 SGR 00412). Author Fernando Vázquez is supported by PRE2022-104134 funded by MICIU/AEI /10.13039/501100011033 and by the FSE+.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Programming parallel dense matrix factorizations and inversion for new-generation NUMA architectures

  • Catalán, Sandra
  • Igual, Francisco D.
  • Herrero, José R.
  • Rodríguez-Sánchez, Rafael
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
[EN] We propose a methodology to address the programmability issues derived from the emergence of newgeneration shared-memory NUMA architectures. For this purpose, we employ dense matrix factorizations and matrix inversion (DMFI) as a use case, and we target two modern architectures (AMD Rome and Huawei Kunpeng 920) that exhibit configurable NUMA topologies. Our methodology pursues performance portability across different NUMA configurations by proposing multi-domain implementations for DMFI plus a hybrid task- and loop-level parallelization that configures multi-threaded executions to fix core-todata binding, exploiting locality at the expense of minor code modifications. In addition, we introduce a generalization of the multi-domain implementations for DMFI that offers support for virtually any NUMA topology in present and future architectures. Our experimentation on the two target architectures for three representative dense linear algebra operations validates the proposal, reveals insights on the necessity of adapting both the codes and their execution to improve data access locality, and reports performance across architectures and inter- and intra-socket NUMA configurations competitive with state-of-the-art message-passing implementations, maintaining the ease of development usually associated with shared-memory programming., This research was sponsored by project PID2019-107255GB of Ministerio de Ciencia, Innovacion y Universidades; project S2018/TCS-4423 of Comunidad de Madrid; project 2017-SGR-1414 of the Generalitat de Catalunya and the Madrid Government under the Multiannual Agreement with UCM in the line Pro-gram to Stimulate Research for Young Doctors in the context of the V PRICIT, project PR65/19-22445. This project has also re-ceived funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 955558. The JU receives support from the European Union's Horizon 2020 research and innovation programme, and Spain, Germany, France, Italy, Poland, Switzerland, Norway. The work is also supported by grants PID2020-113656RB-C22 and PID2021-126576NB-I00 of MCIN/AEI/10.13039/501100011033 and by ERDF A way of making Europe.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Accurately Measuring Contention in Mesh NoCs in Time-Sensitive Embedded Systems

  • Cardona, Jordi
  • Abella, Jaume
  • Mezzetti, Enrico
  • Cazorla, Francisco J.
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] The computing capacity demanded by embedded systems is on the rise as software implements more functionalities, ranging from best-effort entertainment functions to performance-guaranteed safety-related functions. Heterogeneous manycore processors, using wormhole mesh (wmesh) Network-on-Chips (NoCs) as the main communication means, and contention block among applications, are increasingly considered to deliver the required computing performance. Most research efforts on software timing analysis have focused on deriving bounds (estimates) to the contention that tasks can suffer when accessing wmesh NoCs. However, less effort has been devoted to an equally important problem, namely, accurately measuring the actual contention tasks generate each other on the wmesh which is instrumental during system validation to diagnose any software timing misbehavior and determine which tasks are particularly affected by contention on specific wmesh routers. In this article, we work on the foundations of contention measuring in wmesh NoCs and propose and explain the rationale of a golden metric, called task PairWise Contention (PWC). PWC allows ascribing the actual share of the contention a given task suffers in the wmesh to each of its co-runner tasks at packet level. We also introduce and formalize a Golden Reference Value (GRV) for PWC that specifically defines a criterion to fairly break down the contention suffered by a task among its co-runner tasks in the wmesh. Our evaluation shows that GRV effectively captures how contention occurs by identifying the actual core (task) causing contention and whether contention is caused by local or remote interference in the wmesh., This work has been supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB-C21 funded by MCIN/AEI/10.13039/501100011033 and the European Research Council (ERC) under the EU's Horizon 2020 research and innovation programme (grant agreement No. 772773).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Cache-aware optimization of matrix multiplication and matrix factorizations on multicore processors

  • Martínez-Pérez, Héctor
  • Catalán, Sandra
  • Igual, Francisco D.
  • Herrero, José R.
  • Rodríguez-Sánchez, Rafael
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
[EN] This paper advocates for a careful customization of the special general matrix multiplication (GEMM) kernels that are invoked from blocked routines for several relevant matrix factorizations in LAPACK, in order to improve their performance on modern multicore processors with hierarchical cache memories. To achieve this, we leverage a refined analytical model to dynamically tune the cache configuration parameters of GEMM for these kernels, taking into account the matrix operands' dimensions, in order to improve cache occupation. In addition, toward the same goal, we accommodate a flexible development of architecture-specific micro-kernels for GEMM that allows us to select the option that, depending on the operands' dimensions, ameliorates cache utilization. Our experiments for the LU and QR factorizations on two platforms, equipped with ARM (NVIDIA Carmel) and x86 (AMD EPYC) multi-core processors, demonstrate the benefits of this approach in terms of a better cache utilization and, in general, higher performance. Moreover, they also reveal the delicate balance between optimizing for multi-threaded parallelism versus cache usage as well as the positive effects of software prefetching., This work was supported by grants PID2020-113656RB-C22, PID2019-107255GB, PID2021-126576NB-I00 and PID2021-123627OB-C52 of MCIN/AEI/10.13039/501100011033, by "ERDF A way of making Europe", and 2021-SGR-01007 of the Generalitat de Catalunya. Hector Martinez is a postdoctoral fellow supported by the Consejeria de Transformacion Economica, Industria, Conocimiento y Universidades de la Junta de Andalucia. Sandra Catalan was supported by the grant RYC2021-033973- I, funded by MCIN/AEI/10.13039/501100011033 and the European Union "NextGenerationEU"/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Fine-grain task-parallel algorithms for matrix factorizations and inversion on many-threaded CPUs

  • Catalán, Sandra
  • Herrero, José R.
  • Igual, Francisco D.
  • Rodríguez-Sánchez, Rafael
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
[EN] We extend a two-level task partitioning previously applied to the inversion of dense matrices via Gauss-Jordan elimination to the more challenging QR factorization as well as the initial orthogonal reduction to band form found in the singular value decomposition. Our new task-parallel algorithms leverage the tasking mechanism currently available in OpenMP to exploit "nested" task parallelism, with a first outer level that operates on matrix panels and a second inner level that processes the matrix either by mu$$ \mu $$-panels or by tiles, in order to expose a large number of independent tasks. We present a detailed performance analysis, including execution traces, which shows that the two-level refinement into fine grain tasks allows for an improved load balancing and delivers high performance on current general-purpose many-core processors (CPUs) from Intel and AMD., This research was sponsored by projects RTI2018-093684-B-I00, PID2019-107255GB and TIN2017-82972-R ofMinisterio de Ciencia, Innovación y Universidades; project S2018/TCS-4423 of Comunidad de Madrid; project 2017-SGR-1414 of the Generalitat de Catalunya and the Madrid Government under the Multiannual Agreement with UCM in the line Program to Stimulate Research for Young Doctors in the context of the V PRICIT, project PR65/19-22445.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Virtualization Technology for Dependable Embedded Systems: A Survey for Transportation and Industrial Domains

  • Pérez-Cerrolaza, Jon
  • Mezzetti, Enrico
  • Gonzalez-Eguiluz, Jon
  • Martín-Acosta, Miguel
  • Lefebvre, Charles-Alexis
  • Balbastre, Patricia|||0000-0001-9458-4083
  • Crespo, Alfons|||0000-0002-6606-7406
[EN] Next-generation transportation and industrial systems are characterized by a continuously increasing number of integrated software functionalities and computational performance requirements. Nevertheless, there is also a need to reduce the cost, number, size, power consumption, volume and weight of integrated dependable embedded systems. In this context, virtualization technology enables the reconciliation of these challenges supporting the integration of multiple software functionalities of mixed-criticality (real-time and non-real-time, safety and non-safety-related) on a single computing device. This survey provides an overview of virtualization solutions (hypervisors, microkernels, and separation kernels) and categorizes research contributions addressing virtualization, real-time, dependability, and domain-specific technological challenges., This work has been partially supported by European Research Council with Horizon 2020 (grant agreement No. 101082622), the Spanish Ministry of Science and Innovation (grant agreements No. PID2019-107255GB-C21, PID2021-124502OB-C41), and by grant PLEC2021-007609 funded by MICIU/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Hardware Acceleration for High-Volume Operations of CRYSTALS-Kyber and CRYSTALS-Dilithium

  • Carril, Xavier
  • Kardaris, Charalampos
  • Ribes-González, Jordi
  • Farràs, Oriol
  • Kostalabros, Vatistas
  • González-Jiménez, Joel Ulises
  • Moreto, Miquel
  • Hernández Luz, Carles|||0000-0003-1192-6223
[EN] Many high-demand digital services need to perform several cryptographic operations, such as key exchange or security credentialing, in a concise amount of time. In turn, the security of some of these cryptographic schemes is threatened by advances in quantum computing, as quantum computer could break their security in the near future. Post-quantum cryptography (PQC) is an emerging field that studies cryptographic algorithms that resist such attacks. The National Institute of Standards and Technology (NIST) has selected the CRYSTALSKyber Key Encapsulation Mechanism and the CRYSTALS-Dilithium Digital Signature algorithm as primary PQC standards. In this article, we present field-programmable gate array (FPGA)-based hardware accelerators for high-volume operations of both schemes. We apply high-level synthesis (HLS) for hardware optimization, leveraging a batch processing approach to maximize the memory throughput and applying custom HLS logic to specific algorithmic components. Using reconfigurable FPGAs, we show that our hardware accelerators achieve speedups between 3x and 9x over software baseline implementations, even over ones leveraging CPU vector architectures. Furthermore, the methods used in this study can also be extended to the new CRYSTALS-based NIST FIPS drafts, ML-KEM and ML-DSA, with similar acceleration results., This work was part of the project (ISOLDE) , funded by MICIU/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR under Grant No. PCI2023-143372, and the European Union's Horizon Europe Programme under project Chips Joint Undertaking (JU) under Grant No. 101112274. At the same time, 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 (contract PID2019-107255GB-C21) , and by the Government of Catalonia (contract 2021-SGR-763) .X. Carril has the support of the predoctoral programme AGAUR-FI grants (2024 FI-1 00520) Joan Oro from the Secretariat for Universities and Research of the Department of Research and Universities of the Generalitat de Catalunya and theEuropean Social Fund Plus. J. Ribes-Gonzalez and O. Farras are supported by grant 2021-SGR-00115 from the Government of Catalonia, by the project HERMES, funded by INCIBE and by the European Union NextGeneration EU/PRTR, and the project ACITHEC PID2021-124928NB-I00, funded by MCIN/AEI/10.13039/501100011033. C. Hernandez was supported by "Ramony Cajal" fellowship No. RYC2020-030685-I. V. Kostalabros was supported by the Agency for Management of Universityand Research Grants (AGAUR) of the Government of Catalonia under "Ajuts per a la contractacio de personal investigadornovell" fellowship No. 2019FIB01274.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Hunting for open clusters in Gaia EDR3: 628 new open clusters found with OCfinder

  • Castro-Ginard, Alfred
  • Jordi, Carme
  • Luri, Xavier
  • Cantat-Gaudin, Tristan
  • Carrasco, J. M.
  • Casamiquela, Laia
  • Anders, Friedrich
  • Balaguer-Nuñez, Lola
  • Badia, Rosa M.
[Context] The improvements in the precision of the published data in Gaia EDR3 with respect to Gaia DR2, particularly for parallaxes and proper motions, offer the opportunity to increase the number of known open clusters in the Milky Way by detecting farther and fainter objects that have thus far gone unnoticed. [Aims] Our aim is to continue to complete the open cluster census in the Milky Way with the detection of new stellar groups in the Galactic disc. We use Gaia EDR3 up to magnitude G = 18 mag, increasing the magnitude limit and therefore the search volume explored in one unit with respect to our previous studies. [Methods] We used the OCfinder method to search for new open clusters in Gaia EDR3 using a big data environment. As a first step, OCfinder identified stellar statistical overdensities in five-dimensional astrometric space (position, parallax, and proper motions) using the DBSCAN clustering algorithm. Then, these overdensities were classified into random statistical overdensities or real physical open clusters using a deep artificial neural network trained on well-characterised G, GBP - GRP colour-magnitude diagrams. [Results] We report the discovery of 628 new open clusters within the Galactic disc, with most of them being located beyond 1 kpc from the Sun. From the estimation of ages, distances, and line-of-sight extinctions of these open clusters, we see that young clusters align following the Galactic spiral arms while older ones are dispersed in the Galactic disc. Furthermore, we find that most open clusters are located at low Galactic altitudes with the exception of a few groups older than 1 Gyr. [Conclusions] We show the success of the OCfinder method leading to the discovery of a total of 1274 open clusters (joining the discoveries here with the previous ones based on Gaia DR2), which represents almost 50% of the known population. Our ability to perform big data searches on a large volume of the Galactic disc, together with the higher precision in Gaia EDR3, enable us to keep completing the census with the discovery of new open clusters., This work was (partially) funded by the Spanish MICIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” by the “European Union” through grant RTI2018-095076-B-C21, and the Institute of Cosmos Sciences University of Barcelona (ICCUB, Unidad de Excelencia ‘María de Maeztu’) through grant CEX2019-000918-M. A.C.G. acknowledges Spanish Ministry FPI fellowship n. BES-2016-078499. This work has been partially supported by the Spanish Government (PID2019-107255GB), by Generalitat de Catalunya (contract 2014-SGR-1051).
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Makinote: An FPGA-based HW/SW platform for pre-silicon emulation of RISC-V designs

  • Perdomo Hourné, Elias Augusto|||0000-0002-2279-6068
  • Kropotov, Alexander
  • Cano Ladino, Francelly Katherine
  • Ali Shah, Syed Zafar
  • Cervero García, Teresa
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Salami, Behzad
Emulating chip functionality before silicon production is crucial, especially with the increasing prevalence of RISC-V-based designs. FPGAs are promising candidates for such purposes due to their high-speed and reconfigurable architecture. In this paper, we introduce our Makinote, an FPGA-based Cluster platform, hosted at Barcelona Supercomputing Center (BSC-CNS), which is composed of a large number of FPGAs (in total 96 AMD/Xilinx Alveo U55c) to emulate massive size RTL designs (up to 750M ASIC cells)1. In addition, we introduce our FPGA shell as a powerful tool to facilitate the utilization of such a large FPGA cluster with minimal effort needed by the designers. The proposed FPGA shell provides an easy-to-use interface for the RTL developers to rapidly port such design into several FPGAs by automatically connecting to the necessary ports, e.g., PCIe Gen4, DRAM (DDR4 and HBM), ETH10g/100g. Moreover, specific drivers for exploiting RISC-V based architectures are provided within the set of tools associated with the FPGA shell. We release the tool online for further extensions.2 We validate the efficiency of our hardware platform (i.e., FPGA cluster) and the software tool (i.e., FPGA Shell) by emulating a RISC-V processor and experimenting HPC Challenge application running on 32 FPGAs. Our results demonstrate that the performance improves by 8 times over the single-FPGA case., This work has received funding from the MEEP project (European High-Performance Computing Joint Undertaking (JU) under grant agreement No 946002), from ”Lenovo-BSC Contract-Framework (2022)”, from the Spanish Government (PID2019-107255GB-C21/AEI /10.13039/501100011033, CEX2021-001148-S funded by MCIN/AEI / 10.13039/501100011033), and from Generalitat de Catalunya (contract 2021-SGR-01007)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Advanced synchronization techniques for task-based runtime systems

  • Álvarez Robert, David
  • Sala Penadés, Kevin|||0000-0001-8233-1185
  • Maroñas Bravo, Marcos
  • Roca Nonell, Aleix|||0000-0002-6715-3605
  • Beltran Querol, Vicenç
Task-based programming models like OmpSs-2 and OpenMP provide a flexible data-flow execution model to exploit dynamic, irregular and nested parallelism. Providing an efficient implementation that scales well with small granularity tasks remains a challenge, and bottlenecks can manifest in several runtime components. In this paper, we analyze the limiting factors in the scalability of a task-based runtime system and propose individual solutions for each of the challenges, including a wait-free dependency system and a novel scalable scheduler design based on delegation. We evaluate how the optimizations impact the overall performance of the runtime, both individually and in combination. We also compare the resulting runtime against state of the art OpenMP implementations, showing equivalent or better performance, especially for fine-grained tasks., This project is supported by the European Union’s Horizon 2020 Research and Innovation programme under grant agreement No.s 754304 (DEEP-EST), by the Spanish Ministry of Science and Innovation (contract PID2019-107255GB and TIN2015-65316P) and by the Generalitat de Catalunya (2017-SGR-1414)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Enhancing HPC with serverless computing: Lithops on MareNostrum5

  • Benavides Arévalo, Andrés
  • Coll Tejeda, Daniel
  • Call Barreiro, Erin|||0000-0002-2770-1662
  • Garcia López, Pedro
  • Nou Castell, Ramon|||0000-0003-0464-1473
Serverless computing offers a novel alternative for developing and deploying applications. By abstracting backend architecture from the user, developers are encouraged to write code without worrying about server management, scaling, or maintenance. The Function-as-a-Service (FaaS) model optimizes this by allowing developers to deploy discrete functions that scale automatically in response to demand without deep concerns about the scalability of the execution infrastructure or platform. Lithops, a multi-cloud serverless computing framework, follows this trend and enables developers to execute Python code across thousands of cloud cores without modifying local scripts. Despite its potential to deploy parallel jobs, Lithops has been designed for running big data jobs over cloud environments, and its applicability to High-Performance Computing (HPC) systems has been unexplored. This paper introduces a novel architecture enabling Lithops deployment in HPC systems like the MareNostrum 5 supercomputer. By leveraging the immense computational power of the HPC-MN5 supercomputer and the FaaS model of Lithops, the architecture aims to offer high performance and scalability while simplifying application coding and deployment. Our evaluations display Lithops' benchmarks over the MareNostrum 5 HPC scale with the number of nodes, outperforming other commercial cloud platforms in terms of Floating Point Operations Per Second (FLOPS) and read-write bandwidth, and avoiding CPU wastage., This work has been partially financed by the European Commission (EU-HORIZON NEARDATA GA 101092644), Ministry of Science and Innovation under grant MCIN AEI/10.13039/ 501100011033/FEDER and PID GA PID2019- 107255GB-C21, and the Generalitat de Catalunya (AGAUR) under grant agreements 2021-SGR-00478 and 2021-SGR01626. The authors thankfully acknowledge RES resources provided by Barcelona Supercomputing Center in Data-Centric Computing Group to BCV-2024-2-0004., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

SPARROW: A low-cost hardware/software co-designed SIMD microarchitecture for AI operations in space processors

  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Kosmidis, Leonidas
Recently there is an increasing interest in the use of artificial intelligence for on-board processing as indicated by the latest space missions, which cannot be satisfied by existing low-performance space-qualified processors. Although COTS AI accelerators can provide the required performance, they are not designed to meet space requirements. In this work, we co-design a low-cost SIMD micro-architecture integrated in a space qualified processor, which can significantly increase its performance. Our solution has no impact on the processor's 100 MHz frequency and consumes minimal area thanks to its innovative design compared to conventional vector micro-architectures. For the minimum configuration of our baseline space processor, our results indicate a performance boost of up to 9.3× for commonly used AI-related and image processing algorithms and 5.5× faster for a complex, space-relevant inference application with just 30% area increase., This work was supported by ESA through the GPU4S (GPU for Space) project, the Spanish Ministry of Economy and Competitiveness under grants PID2019- 107255GB and FJCI-2017-34095 (Spanish State Research Agency / http://dx.doi.org/10.13039/501100011033), the European Commission’s Horizon 2020 programme under the UP2DATE project (grant agreement 871465), the HiPEAC Network of Excellence and a first prize in Xilinx’s University Open Hardware Competition 2021 in the student category., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Towards automatic model specialization for edge video analytics

  • Rivas Barragan, Daniel
  • Guim Bernat, Francesc
  • Polo Bardés, Jorda
  • Silva, Pubudu Madhawa
  • Berral García, Josep Lluís|||0000-0003-3037-3580
  • Carrera Pérez, David|||0000-0003-4898-3424
The number of cameras deployed to the edge of the network increases by the day, while emerging use cases, such as smart cities or autonomous driving, also grow to expect images to be analyzed in real-time by increasingly accurate and complex neural networks. Unfortunately, state-of-the-art accuracy comes at a computational cost rarely available in the edge cloud. At the same time, due to strict latency constraints and the vast amount of bandwidth edge cameras generate, we can no longer rely on offloading the task to a centralized cloud. Consequently, there is a need for a meeting point between the resource-constrained edge cloud and accurate real-time video analytics. If state-of-the-art models are too expensive to run on the edge, and lightweight models are not accurate enough for the use cases in the edge, one solution is to demand less from the lightweight model and specialize it in a narrower scope of the problem, a technique known as model specialization. By specializing a model to the context of a single camera, we can boost its accuracy while keeping its computational cost constant. However, this also involves one training per camera, which quickly becomes unfeasible unless the entire process is fully automated. In this paper, we present and evaluate COVA (Contextually Optimized Video Analytics), a framework to assist in the automatic specialization of models for video analytics in edge cloud cameras. COVA aims to automatically improve the accuracy of lightweight models by specializing them to the context to which they will be deployed. Moreover, we discuss and analyze each step involved in the process to understand the different trade-offs that each one entails. Using COVA, we demonstrate that the whole pipeline can be effectively automated by leveraging large neural networks used as teachers whose predictions are used to train and specialize lightweight neural networks. Results show that COVA can automatically improve pre-trained models by an average of 21% mAP on the different scenes of the VIRAT dataset., This work has been partially supported by the Spanish Government (contract PID2019-107255GB) and by Generalitat de Catalunya, Spain (contract 2014-SGR-1051)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Space Shuttle: A test vehicle for the reliability of the SkyWater 130nm PDK for future space processors

  • Rodríguez Ferrández, Iván
  • Kosmidis, Leonidas
  • Tali, Maris
  • Steenari, David
Recently the ASIC industry experiences a massive change with more and more small and medium businesses entering the custom ASIC development. This trend is fueled by the recent open hardware movement and relevant government and privately funded initiatives. These new developments can open new opportunities in the space sector – which is traditionally characterised by very low volumes and very high non-recurrent (NRE) costs – if we can show that the produced chips have favourable radiation properties. In this paper, we describe the design and tape-out of Space Shuttle, the first test chip for the evaluation of the suitability of the SkyWater 130nm PDK and the OpenLane EDA toolchain using the Google/E-fabless shuttle run for future space processors., This work was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments”. Moreover, it was partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC2020-045931-I (Spanish State Research Agency / http://dx.doi.org/10.13039/501100011033) and the European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Scanflow: A multi-graph framework for machine learning workflow management, supervision, and debugging

  • Bravo Rocca, Gusseppe Jesus|||0000-0001-6824-1124
  • Liu, Peini|||0000-0003-0058-8732
  • Guitart Fernández, Jordi|||0000-0003-0751-3100
  • Dholakia, Ajay
  • Ellison, David
  • Falkanger, Jeffrey
  • Hodak, Miroslav
Machine Learning (ML) is more than just training models, the whole workflow must be considered. Once deployed, a ML model needs to be watched and constantly supervised and debugged to guarantee its validity and robustness in unexpected situations. Debugging in ML aims to identify (and address) the model weaknesses in not trivial contexts. Several techniques have been proposed to identify different types of model weaknesses, such as bias in classification, model decay, adversarial attacks, etc., yet there is not a generic framework that allows them to work in a collaborative, modular, portable, iterative way and, more importantly, flexible enough to allow both human- and machine-driven techniques. In this paper, we propose a novel containerized directed graph framework to support and accelerate end-to-end ML workflow management, supervision, and debugging. The framework allows defining and deploying ML workflows in containers, tracking their metadata, checking their behavior in production, and improving the models by using both learned and human-provided knowledge. We demonstrate these capabilities by integrating in the framework two hybrid systems to detect data drift distribution which identify the samples that are far from the latent space of the original distribution, ask for human intervention, and whether retrain the model or wrap it with a filter to remove the noise of corrupted data at inference time. We test these systems on MNIST-C, CIFAR-10-C, and FashionMNIST-C datasets, obtaining promising accuracy results with the help of human involvement., This work was partially supported by Lenovo as part of Framework Contract Lenovo-BSC 2020, by the Spanish Government under contract PID2019-107255 GB, and by the Generalitat de Catalunya, Spain under contract 2017-SGR-1414 and under grant 2020 FI-B 00257., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

SafeSU-2: a safe statistics unit for space MPSoCs

  • Cabo Pitarch, Guillem
  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Hernández Luz, Carles
  • Benedicte Illescas, Pedro|||0000-0003-1670-7783
  • Bas Jalón, Francisco
  • Mazzocchetti, Fabio
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
Advanced statistics units (SUs) have been proven effective for the verification, validation and implementation of safety measures as part of safety-related MPSoCs. This is the case, for instance, of the RISC-V MPSoC by CAES Gaisler based on NOEL-V cores that will become commercially ready on FPGAs by the end of 2022. However, while those SUs support safety in the rest of the SoC, they must be built to be safe to be part of commercial products. This paper presents the SafeSU-2, the safety-compliant version of the SafeSU. In particular, we perform a Failure Mode and Effect Analysis (FMEA) for the SafeSU for relevant fault models, and implement fault detection and tolerance features needed to make it compliant with the requirements of safety-related devices in general, and of space MPSoCs in particular., This work has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 871467. This work has also been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GBC21/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

BiSon-e: a lightweight and high-performance accelerator for narrow integer linear algebra computing on the edge

  • Reggiani, Enrico
  • Ramírez Lazo, Cristóbal
  • Figueras Bagué, Roger
  • Cristal Kestelman, Adrián|||0000-0003-1277-9296
  • Olivieri, Mauro
  • Unsal, Osman Sabri
Linear algebra computational kernels based on byte and sub-byte integer data formats are at the base of many classes of applications, ranging from Deep Learning to Pattern Matching. Porting the computation of these applications from cloud to edge and mobile devices would enable significant improvements in terms of security, safety, and energy efficiency. However, despite their low memory and energy demands, their intrinsically high computational intensity makes the execution of these workloads challenging on highly resource-constrained devices. In this paper, we present BiSon-e, a novel RISC-V based architecture that accelerates linear algebra kernels based on narrow integer computations on edge processors by performing Single Instruction Multiple Data (SIMD) operations on off-The-shelf scalar Functional Units (FUs). Our novel architecture is built upon the binary segmentation technique, which allows to significantly reduce the memory footprint and the arithmetic intensity of linear algebra kernels requiring narrow data sizes. We integrate BiSon-e into a complete System-on-Chip (SoC) based on RISC-V, synthesized and Place Routed in 65nm and 22nm technologies, introducing a negligible 0.07% area overhead with respect to the baseline architecture. Our experimental evaluation shows that, when computing the Convolution and Fully-Connected layers of the AlexNet and VGG-16 Convolutional Neural Networks (CNNs) with 8-, 4-, and 2-bit, our solution gains up to 5.6×, 13.9× and 24× in execution time compared to the scalar implementation of a single RISC-V core, and improves the energy efficiency of string matching tasks by 5× when compared to a RISC-V-based Vector Processing Unit (VPU)., This research was supported by the European Union Regional Development Fund within the framework of the ERDF Operational Program of Catalonia 2014-2020 with a grant of 50% of the total cost eligible, under the DRAC project [001-P-001723], and from the Spanish State Research Agency - Ministry of Science and Innovation (contract PID2019-107255GB). This research was also supported by the grant PRE2020-095272 funded by MCIN/AEI/ 10.13039/501100011033 and, by “ESF Investing in your future”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

SafeLS: An open source implementation of a lockstep NOEL-V RISC-V core

  • Sarraseca Julian, Marcel
  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Fuentes Díaz, Francisco Javier
  • Rodríguez Rivas, Juan Carlos
  • Chang, Feng
  • Lasfar, Ilham
  • Canal Corretger, Ramon|||0000-0003-4542-204X
  • Cazorla Almeida, Francisco Javier
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
Microcontrollers running safety-critical applications with high integrity requirements must provide appropriate safety measures to manage random hardware faults. For instance, automotive safety regulations (e.g., ISO26262) impose the use of diverse redundancy for items at the highest automotive safety integrity level (ASIL), ASIL-D. In the case of computing cores, this is realized with dual core lockstep (DCLS). The advent of the RISC-VISA has made open source hardware gain popularity. However, there are few industrial open source SoCs meeting the requirements of safety-critical systems, and, to our knowledge, none of them provides lockstep cores. This paper presents the realization of a RISC-V open source lockstep core based on Gaisler's NOEL-V core for the space domain, as well as its integration in the SELENE SoC that provides a complete microcontroller synthesizable on FPGA successfully assessed against space, automotive and railway safety-critical applications in the past., This work is part of the European Union’s Horizon 2020 Programme under project KDT Joint Undertaking (JU) under grant agreement No 101112274 (ISOLDE). This work has also been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB-C21 funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Practically tackling memory bottlenecks of graph-processing workloads

  • Jamet, Alexandre Valentin
  • Vavouliotis, Georgios
  • Jiménez, Daniel A.
  • Álvarez Martí, Lluc|||0000-0003-0506-8867
  • Casas, Marc|||0000-0003-4564-2093
Graph-processing workloads have become widespread due to their relevance on a wide range of application domains such as network analysis, path- planning, bioinformatics, and machine learning. Graph-processing workloads have massive data footprints that exceed cache storage capacity and exhibit highly irregular memory access patterns due to data-dependent graph traversals. This irregular behaviour causes graph-processing workloads to exhibit poor data locality, undermining their performance. This paper makes two fundamental observations on the memory access patterns of graph-processing workloads: First, conventional cache hierarchies become mostly useless when dealing with graph-processing workloads, since 78.6% of the accesses that miss in the L1 Data Cache (L1D) result in misses in the L2 Cache (L2C) and in the Last Level Cache (LLC), requiring a DRAM access. Second, it is possible to predict whether a memory access will be served by DRAM or not in the context of graph-processing workloads by observing strides between accesses triggered by instructions with the same Program Counter (PC). Our key insight is that bypassing the L2C and the LLC for highly irregular accesses significantly reduces latency cost while also reducing pressure on the lower levels of the cache hierarchy. Based on these observations, this paper proposes the Large Predictor (LP), a low-cost micro-architectural predictor capable of distinguishing between regular and irregular memory accesses. We propose to serve accesses tagged as regular by LP via the standard memory hierarchy, while irregular access are served via the Side Data Cache (SDC). The SDC is a private per-core set-associative cache placed alongside the L1D specifically aimed at reducing the latency cost of highly irregular accesses while avoiding polluting the rest of the cache hierarchy with data that exhibits poor locality. SDC coupled with LP yields geometric mean speed-ups of 20.3% and 20.2% on single- and multi-core scenarios, respectively, over an architecture featuring a conventional cache hierarchy across a set of contemporary graph-processing workloads. In addition, SDC combined with LP outperforms the Transpose-based Cache Replacement (T-OPT), the state-of-the-art cache replacement policy for graph-processing applications, by 10.9% and 13.8% on single-core and multi-core contexts, respectively. Regarding the hardware budget, SDC coupled with LP requires 10KB of storage per core., 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 and PID2019-105660RB-C22) and by the Generalitat de Catalunya (contract 2021-SGR-00763). This work is supported by the National Science Foundation through grant CCF-1912617 and generous gifts from Intel. Marc Casas has been partially supported by the Grant RYC-2017-23269 funded by MCIN/AEI/10.13039/501100011033 and by ESF Investing in your future. Els autors agraeixen el suport del Departament de Recerca i Universitats de la Generalitat de Catalunya al Grup de Recerca ”Performance understanding, analysis, and simulation/emulation of novel architectures” (Codi: 2021 SGR 00865). This research has received funding from the European High Performance Computing Joint Undertaking (JU) under Framework Partnership Agreement No 800928 (European Processor Initiative) and Specific Grant Agreement No 101036168 (EPI SGA2). The JU receives support from the European Union’s Horizon 2020 research and innovation programme and from Croatia, France, Germany, Greece, Italy, Netherlands, Portugal, Spain, Sweden, and Switzerland. The EPI-SGA2 project, PCI2022-132935 is also co-funded by MCIN/AEI /10.13039/501100011033 and by the UE NextGenerationEU/PRTR., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Challenges and opportunities for RISC-V architectures towards genomics-based workloads

  • Gómez Sánchez, Gonzalo
  • Call Barreiro, Erin|||0000-0002-2770-1662
  • Teruel García, Xavier
  • Alonso Parrilla, Lorena
  • Morán Castany, Ignasi
  • Pérez Elena, Miguel Ángel
  • Torrents Arenales, David
  • Berral García, Josep Lluís|||0000-0003-3037-3580
The use of large-scale supercomputing architectures is a hard requirement for scientific computing Big-Data applications. An example is genomics analytics, where millions of data transformations and tests per patient need to be done to find relevant clinical indicators. Therefore, to ensure open and broad access to high-performance technologies, governments, and academia are pushing toward the introduction of novel computing architectures in large-scale scientific environments. This is the case of RISC-V, an open-source and royalty-free instruction-set architecture. To evaluate such technologies, here we present the Variant-Interaction Analytics use case benchmarking suite and datasets. Through this use case, we search for possible genetic interactions using computational and statistical methods, providing a representative case for heavy ETL (Extract, Transform, Load) data processing. Current implementations are implemented in x86-based supercomputers (e.g. MareNostrum-IV at the Barcelona Supercomputing Center (BSC)), and future steps propose RISC-V as part of the next MareNostrum generations. Here we describe the Variant Interaction Use Case, highlighting the characteristics leveraging high-performance computing, indicating the caveats and challenges towards the next RISC-V developments and designs to come from a first comparison between x86 and RISC-V architectures on real Variant Interaction executions over real hardware implementations., This work has been partially financed by the European Commission (EU-HORIZON NEARDATA GA.101092644, VITAMIN-V GA.101093062), the MEEP Project which 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. Also by the Spanish Ministry of Science (MICINN) under scholarship BES-2017-081635, the Research State Agency (AEI) and European Regional Development Funds (ERDF/FEDER) under DALEST grant agreement PID2021-126248OBI00, MCIN/AEI/10.13039/ 501100011033/FEDER and PID GA PID2019-107255GB-C21, and the Generalitat de Catalunya (AGAUR) under grant agreements 2021-SGR-00478, 2021-SGR-01626 and ”FSE Invertint en el teu futur”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

XeroZerox: Analysis and Optimization of GPU Memory Management for High-Integrity Autonomous Systems

  • Calderón, Alejandro J.
  • Kosmidis, Leonidas
  • Nicolás, Carlos F.
  • Cazorla Almeida, Francisco Javier
Autonomous systems require high-performance processing capabilities, which demand the use of powerful accelerators such as GPUs. However, the use of GPUs in critical systems presents several challenges, since GPU programming models rely on explicit dynamic memory management. Traditionally, dynamic memory allocation in such systems is restricted to certain controlled scenarios, which require programs to be rewritten so that all the required memory is allocated at the beginning of the program and released at its end. However, many GPU applications do not follow this approach. Moreover, when dynamic memory allocation is used, it is critical to compute the exact amount of memory that will be used as well as to minimize it, to guarantee that it fits in the physical system memory. In this paper we present XeroZerox, an open-source tool that automatically converts the traditional dynamic memory allocations of GPU applications into allocations served from a centralized and optimally sized memory pool, which is managed in a way better suited for critical systems. XeroZerox allows legacy GPU applications to be used in a critical setup without rewriting them, minimizing at the same time their memory consumption and memory management runtime overhead., Spanish Ministry of Economy and Competitiveness (Grant Number: IJC-2020-045931-I and PID2019-107255GB-C21) Department of Research and Universities of the Government of Catalonia (Grant Number: 2021 SGR 00637) European Union Horizon Europe Programme (Grant Number: 101082622), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Automatic, efficient and scalable provenance registration for FAIR HPC workflows

  • Sirvent Pardell, Raül|||0000-0003-0606-2512
  • Conejero Bañón, Francisco Javier
  • Lordan Gomis, Francesc|||0000-0002-9845-8890
  • Ejarque Artigas, Jorge
  • Rodríguez Navas, Laura
  • Fernández González, José María
  • Capella Gutiérrez, Salvador|||0000-0002-0309-604X
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
Provenance registration is becoming more and more important, as we increase the size and number of experiments performed using computers. In particular, when provenance is recorded in HPC environments, it must be efficient and scalable. In this paper, we propose a provenance registration method for scientific workflows, efficient enough to run in supercomputers (thus, it could run in other environments with more relaxed restrictions, such as distributed ones). It also must be scalable in order to deal with large workflows, that are more typically used in HPC. We also target transparency for the user, shielding them from having to specify how provenance must be recorded. We implement our design using the COMPSs programming model as a Workflow Management System (WfMS) and use RO-Crate as a well-established specification to record and publish provenance. Experiments are provided, demonstrating the run time efficiency and scalability of our solution., This work has been supported by the Spanish Government (PID2019-107255GB-C21), by Generalitat de Catalunya (contract 2017-SGR-01414) and the EU’s Horizon research and innovation programme under Grant agreement No 101058129 (DT-GEO). Also, it has been contributed in the CECH project, co-funded with 50% by the European Regional Development Fund under the framework of the ERFD Operative Programme for Catalunya 2014-2020, with a grant of 1.527.637,88 C. LRN, JMF and SCG are partly supported by INB Grant (PT17/0009/0001 - ISCIII-SGEFI / ERDF), and their work received funding from the EU’s Horizon 2020 research and innovation programme under grant agreements EOSC-Life No 824087, and EJP RD No 825575., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A safety-critical, RISC-V SoC integrated and ASIC-ready classic McEliece accelerator

  • Kostalampros, Ioannis-Vatistas|||0000-0003-1912-5092
  • Ribes González, Jordi
  • Farràs Ventura, Oriol
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Hernández Luz, Carles
Security is an integral part of ensuring the integrity of safety-critical systems. Safety-critical systems with extremely long-lifespan, such as the ones employed in the space and automotive industry, need additional security measures that can guarantee the thwarting of both current and future attacks. In that respect, the future advent of large-scale quantum computers, could potentially compromise the security of such systems leading to catastrophic consequences. To this end, in this paper we present the integration of the post-quantum cryptosystem of Classic McEliece (CM) in an open-source platform for high-performance safety-critical systems (SELENE). The SELENE project proposed a new family of safety-critical computing platforms, which builds upon open source components such as the RISC-V instruction set architecture, GNU/Linux, and the Jailhouse hypervisor. This work capitalizes on the modularity of the SELENE hardware platform and proposes a high-performance and constant-time HLS-based accelerator of the encoding and decoding subroutines of CM. We specifically present the first integration of a CM accelerator in a Linux-capable and RISC-V based System-on-Chip (SoC). Our experiments show significant speedups of up to 4.9x and 198x compared to a scalar software implementation of CM encoding and decoding subroutines respectively, executed on an x86 core. We additionally showcase a successful implementation of our accelerator in an ASIC context using the Global Foundries 22 nm technology node operating at >1 GHz frequency., 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 ACITHEC PID2021-124928NBI00, PID2019-107255GB-C21 and “Ramón y Cajal” fellowship No. RYC2020-030685- I), by the Generalitat de Catalunya (contract 2021-SGR-00763), by the Agency for Management of University and Research Grants (AGAUR) of the Government of Catalonia under “Ajuts per a la contractació de personal investigador novell” fellowship No. 2019FI B01274 and the grant 2021SGR 00115, by the European Union within the framework of the ERDF of Catalonia 2014–2020 under the DRAC project [001-P001723], by the project HERMES funded by INCIBE, and by the European NextGenerationEU/PRTR., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Black-Box IP Validation with the SafeTI Traffic Injector: A Success Story

  • Fuentes, Francisco
  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Casanova, Raimon
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
Functional and performance validation of high-performance safety-related hardware platforms require generating specific traffic patterns in the network-on-chip (NoC) to test IP components and their integration. Software-only tests offer indirect control on the NoC traffic and are subject to numerous constraints (e.g., the inability to inject bursty traffic synchronously since cores may not be able to generate it explicitly). Instead, hardware traffic injectors, such as the SafeTI are much more versatile and controllable.This paper presents how our SafeTI hardware traffic injector can be used for the validation of an L2 cache in a safety-relevant space MPSoC by Frontgrade Gaisler, and how such validation process allowed identifying a hard-to-detect design flaw that led to decreased available cache space. Overall, our experience shows a specific application of the SafeTI for black-box IP validation and a success story for that application., This work is part of the project (ISOLDE), funded by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR under grant PCI2023-143372, and the European Union’s Horizon Europe Programme under project KDT Joint Undertaking (JU) under grant agreement No 101112274. This work has also been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB-C21 funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Boosting HPC data analysis performance with the ParSoDA-Py library

  • Belcastro, Loris
  • Giampà, Salvatore
  • Marozzo, Fabrizio
  • Talia, Domenico
  • Trunfio, Paolo
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Ejarque, Jorge|||0000-0003-4725-5097
  • Mammadli, Nihad
Developing and executing large-scale data analysis applications in parallel and distributed environments can be a complex and time-consuming task. Developers often find themselves diverted from their application logic to handle technical details about the underlying runtime and related issues. To simplify this process, ParSoDA, a Java library, has been proposed to facilitate the development of parallel data mining applications executed on HPC systems. It simplifies the process by providing built-in scalability mechanisms relying on the Hadoop and Spark frameworks. This paper presents ParSoDA-Py, the Python version of the ParSoDA library, which allows for further support of commonly used runtimes and libraries for big data analysis. After a complete library redesign, ParSoDA can be now easily integrated with other Python-based distributed runtimes for HPC systems, such as COMPSs and Apache Spark, and with the large ecosystem of Python-based data processing libraries. The paper discusses the adaptation process, which takes into consideration the new technical requirements, and evaluates both usability and scalability through some case study applications., This work has been partially funded by the European Commission’s Horizon 2020 Framework program and the European High-Performance Computing Joint Undertaking (JU) under Grant agreement No 955558 and by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR (PCI2021-121957), project eFlows4HPC. It has also been supported by the Spanish Government (PID2019-107255GB) and by the Departament de Recerca i Universitats de la Generalitat de Catalunya to the Research Group MPiEDist (2021 SGR 00412) We also acknowledge financial support from “National Centre for HPC, Big Data and Quantum Computing," CN00000013 - CUP H23C22000360005, and from “FAIR - Future Artificial Intelligence Research" Project - CUP H23C22000860006., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

O(n) key–value sort with active compute memory

  • Esmaili Dokht, Pouya
  • Guiot Cusido, Miquel
  • Radojkovic, Petar
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
  • Adlard, Jason
  • Amato, Paolo
  • Sforzin, Marco
We propose the Active Compute Memory (ACM), a near-memory-processing architecture capable of performing key–value sort directly in the DRAM. In the ACM architecture, sort is merely the writing of data into memory with one addressing protocol (perspective) and reading it back with different perspective. The first perspective is conventional, based on the data address; the second perspective is the sorted order. The ACM requires additional tables to store the meta-data and moderate control logic enhancements that can be implemented directly in the DRAM silicon. By these modest enhancements to DRAM, ACM exploits the parallelism inherently available in the row buffer to enable sort with O ( n ) complexity. This leads to an order of magnitude improvement in ACM performance and energy compared to conventional O ( n log n ) CPU-centric sort algorithms. The ACM also shows superior performance compared to other near-memory sort accelerators. This is because the ACM processing is done near the row buffer and it exploits much lower memory access latency, higher bandwidth and wider parallel processing. The sort operation covered in this paper is just an example of an address management operation that can be efficiently implemented directly in the DRAM silicon. We release as an open source the simulation infrastructure for the ACM performance and energy modeling. We would encourage the community to use it, adapt it to other PIM proposals, and share their own evaluations., This work was funded by the Collaboration Agreement between Micron Technology, Inc. and BSC. The work was also supported by the Spanish Government, under the contracts PID2019-107255GB-C21 and CEX2021-001148-S funded by MCIN/AEI/ 10.13039/501100011033. The work also received funding from the Department of Research and Universities of the Government of Catalonia to the AccMem Research Group (Code: 2021 SGR 00807) and project DEEP-SEA funded by European Union’s Horizon 2020 research and innovation programme , under Grant Agreement no.955606 and the Spanish Government, under the contract PCI2021-121958 funded by MCIN/AEI/ 10.13039/501100011033 and “European Union NextGenerationEU/PRTR”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Design and implementation of an open source OpenGL SC 2.0.1 installable client driver and offline compiler

  • Trompouki, Matina Maria
  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Pedrajas Pérez, Josué
  • Kosmidis, Leonidas
OpenGL SC 2 is Khronos’ Graphics API for safety critical systems. However, unlike other Khronos’ APIs, available OpenGL SC 2 drivers are only provided by vendors to their customers. This hinders the wide adoption of OpenGL SC 2, which is limited to a niche market, since there are very limited available resources for it. In this work, we describe the design and implementation of an Open Source Installable Client Driver (ICD) and offline compiler on top of OpenGL ES 2.0. Thus, our solution enables the development of OpenGL SC 2.0.1 applications on any embedded system, as well as their deployment on selected safety critical platforms, which do not have an available OpenGL SC 2.0.1 driver yet., This work was supported by the European Union’s Horizon Europe programme under the METASAT project (grant agreement 101082622). It was also partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC-2020-045931-I (Spanish State Research Agency/Agencia Española de Investigación (AEI)/http://dx.doi.org/10. 13039/501100011033) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Cache-aware sparse patterns for the factorized sparse approximate inverse preconditioner

  • Laut Turón, Sergi
  • Borrell Pol, Ricard
  • Casas, Marc|||0000-0003-4564-2093
Conjugate Gradient is a widely used iterative method to solve linear systems Ax=b with matrix A being symmetric and positive definite. Part of its effectiveness relies on finding a suitable preconditioner that accelerates its convergence. Factorized Sparse Approximate Inverse (FSAI) preconditioners are a prominent and easily parallelizable option. An essential element of a FSAI preconditioner is the definition of its sparse pattern, which constraints the approximation of the inverse A-1. This definition is generally based on numerical criteria. In this paper we introduce complementary architecture-aware criteria to increase the numerical effectiveness of the preconditioner without incurring in significant performance costs. In particular, we define cache-aware pattern extensions that do not trigger additional cache misses when accessing vector x in the y=Ax Sparse Matrix-Vector (SpMV) kernel. As a result, we obtain very significant reductions in terms of average solution time ranging between 12.94% and 22.85% on three different architectures - Intel Skylake, POWER9 and A64FX - over a set of 72 test matrices., This work is partially supported by the Spanish Ministry of Science and Technology through PID2019-107255GB project and by the Generalitat de Catalunya (contract 2017-SGR-1414). Marc Casas has been partially supported by the Spanish Ministry of Economy, Industry and Competitiveness under Ramon y Cajal fellowship number RYC-2017-23269. It has also been partially supported by the EXCELLERAT project funded by the European Commission’s ICT activity of the H2020 Programme under grant agreement number: 823691., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Towards a qualifiable space cloud approach

  • Kosmidis, Leonidas
  • Trompouki, Matina Maria
  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Álvarez Suárez, Aridane
  • Wolf, Jannis
Traditional space computing relies on older, space proven hardware and software technologies with significantly lower performance compared to COTS processors. Recently a trend towards the use of Commercial-off the Shelf (COTS) processors in New Space, raised the potential of Space Cloud solutions, in which multiple users share the satellite. These solutions rely on the same software stacks used in conventional cloud deployments, namely Linux, which is not qualifiable for space use. In this paper, we describe the solution developed in the METASAT project, which provides an alternative space cloud infrastructure, fully qualifiable for institutional missions. In addition, we provide more details on the traditional space computing as well as new space and the implementation details of cloud space solutions. We demonstrate their deficiencies on institutional missions where qualification is required, and we describe in more detail the approach followed in the Horizon Europe METASAT project, showing its benefits in terms of space qualification., This work was supported by the European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622). In addition, it was partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GBC21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Española de Investigación (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Dynamic load balance of chemical source term evaluation in high-fidelity combustion simulations

  • Ramirez Miranda, Guillem
  • Mira Martínez, Daniel
  • Pérez Sánchez, Eduardo Javier|||0000-0002-5056-415X
  • Surapaneni, Anurag
  • Borrell Pol, Ricard
  • Houzeaux, Guillaume|||0000-0002-2592-1426
  • Garcia Gasulla, Marta|||0000-0003-3682-9905
This paper presents a load balancing strategy for reaction rate evaluation and chemistry integration in reacting flow simulations. The large disparity in scales during combustion introduces stiffness in the numerical integration of the PDEs and generates load imbalance during the parallel execution. The strategy is based on the use of the DLB library to redistribute the computing resources at node level, lending additional CPU-cores to higher loaded MPI processes. This approach does not require explicit data transfer and is activated automatically at runtime. Two chemistry descriptions, detailed and reduced, are evaluated on two different configurations: laminar counterflow flame and a turbulent swirl-stabilized flame. For single-node calculations, speedups of 2.3x and 7x are obtained for the detailed and reduced chemistry, respectively. Results on multi-node runs also show that DLB improves the performance of the pure-MPI code similar to single node runs. It is shown DLB can get performance improvements in both detailed and reduced chemistry calculations., This work has been supported by the Spanish Government (PID2019-107255GB), by Generalitat de Catalunya (contract 2014-SGR-1051), and by the European POP CoE (GA No 824080) and EXCELLERAT project GA No 823691., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

SMX: Heterogeneous architecture for universal sequence alignment acceleration

  • Doblas Font, Max|||0000-0002-8909-3033
  • Shih, Pojui
  • Lostes Cazorla, Óscar|||0000-0001-5166-3806
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Batten, Christopher
  • Marco Sola, Santiago|||0000-0001-7951-3914
Sequence alignment is a fundamental building block for critical applications across multiple fields, such as computational biology and information retrieval. The rapid advancement of genome sequencing technologies and breakthrough generative AI tools, like AlphaFold, has driven an exponential increase in sequence-data production, creating a pressing need for fast and efficient sequence alignment tools to analyze ever-growing biological sequence databases. Notwithstanding the numerous accelerators proposed, from general-purpose architectures (CPUs and GPUs) to domain-specific designs (FPGAs and ASICs), the most efficient solutions suffer from over-specialization and fail to adapt to the wide variety of irregular use cases demanded by practical sequence alignment applications. Thus, it remains a challenge to design an architecture that can balance efficiency and flexibility to meet the demands of real-world alignment applications. This work introduces SMX, a heterogeneous architecture designed for high-performance sequence alignment that supports various configurations for different sequence types (DNA, protein, and ASCII text) and alignment models (including weighted gaps and substitution matrices). SMX integrates an ISA extension (SMX-1D) for irregular and sequential tasks and a specialized coprocessor (SMX-2D) to accelerate regular and parallel tasks, both orchestrated by the general-purpose core to enable seamless integration with state-of-the-art sequence alignment algorithms. Our results demonstrate that SMX’s heterogeneous architecture accelerates different sequence alignment use cases by 256–744 × compared to state-of-the-art software implementations when aligning real datasets. Compared to specialized hardware accelerators, SMX delivers up to 18.5 × more peak performance per area added while providing greater flexibility to accelerate different use cases. Physical design results targeting a 22nm technology node estimate SMX’s area at 0.34mm2, which is only 30% of a single-issue in-order CPU. SMX offers a high-performance and efficient heterogeneous architecture for accelerating practical sequence alignment algorithms, providing a scalable and flexible solution tailored to meet the needs of modern sequence-analysis tools. Furthermore, an SMX case study explores the frontier between flexibility and efficiency in domain-specific architectures and accelerators., This work has been partially funded by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 and FSE+ [grant number PID2019-107255GB-C21, PID2020-113614RB-C21, TED2021-132634A-I00, and PID2023-146511NB-I00], the Spanish Ministry of Economy, Industry, and Competitiveness through an FPU fellowship [grant number FPU20-04076 to M.D.], LenovoBSC Contract-Framework Contract (2020), the NSF CSSI Award #2311890 and NSF PPoSS Award #2118709, the Spanish Ministry for Digital Transformation and Public Service, and the European Union – NextGenerationEU through the Càtedra Chip UPC project [grant number TSI-069100-2023-0015], the Spanish Ministry for Digital Transformation and Public Service, within the framework of the Recovery, Transformation and Resilience Plan - NextGenerationEU [REGAGE22e00058408992], and the Generalitat de Catalunya GenCat-DIUiE (GRR) [grant numbers 2021-SGR00763, and 2021-SGR-00574]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

The TEXTAROSSA project: Cool all the way down to the hardware

  • Filgueras Izquierdo, Antonio|||0000-0001-6071-3254
  • Agosta, Giovanni
  • Aldinucci, Marco
  • Álvarez Martínez, Carlos|||0000-0003-0536-5183
  • D'Ambra, Pasqua
  • De Haro Ruiz, Juan Miguel|||0000-0002-7427-9118
  • Jiménez González, Daniel|||0000-0001-6064-7883
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Morais, Lucas Henrique
  • Vidal, Miquel|||0000-0002-1973-8289
The TEXTAROSSA project aims to bridge the technology gaps that exascale computing systems will face in the near future in order to overcome their performance and energy efficiency challenges. This project provides solutions for improved energy efficiency and thermal control, seamless integration of heterogeneous accelerators in HPC multi-node platforms, and new arithmetic methods. Challenges are tacked through a co-design approach to heterogeneous HPC solutions, supported by the integration and extension of HW and SW IPs, programming models, and tools derived from European research., This work is supported by the (EuroHPC) TEXTAROSSA project G.A. n.956831, by the Spanish Government (Grants PCI2021-121964 - TEXTAROSSA, PID2019-107255GB-C21MCIN/AEI/10.13039/501100011033, and CEX2021-001148-S), by Generalitat de Catalunya (2021 SGR 01007), by the Italian National Resilience and Recovery Plan (PNRR) via the National Center for HPC, Big Data and Quantum Computing, by the Italian Departments of Excellence grant 2023-2027 Quantum Frontiers, by the Italian Ministry of Economic Development (MISE) project n. 2774 ”TEXTAROSSA”, the European Union via projects EuRyQa and QuantEra’s T-NISQ, and the German Federal Ministry of Education and Research (BMBF) via QRydDemo., Peer Reviewed, Article signat per 41 autors/es: Antonio Filgueras, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Giovanni Agosta, DEIB - Politecnico di Milano, Italy, Centro Interuniversitario Nazionale per l'Informatica (CINI), Italy; Marco Aldinucci, National Research Council (CNR), Italy, University of Torino, Italy; Carlos Álvarez, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Pasqua D’Ambra, National Research Council (CNR), Italy; Massimo Bernaschi, National Research Council (CNR), Italy; Andrea Biagioni, INFN, Sezione di Roma, Italy; Daniele Cattaneo, DEIB - Politecnico di Milano, Italy; Alessandro Celestini, National Research Council (CNR), Italy; Massimo Celino, IENEA, Italy; Carlotta Chiarini, INFN, Sezione di Roma, Italy, Università “Sapienza” di Roma, Italy; Francesca Lo Cicero, INFN, Sezione di Roma, Italy; Paolo Cretaro, INFN, Sezione di Roma, Italy; William Fornaciari, DEIB - Politecnico di Milano, Italy, National Research Council (CNR), Italy; Ottorino Frezza, INFN, Sezione di Roma, Italy; Andrea Galimberti, DEIB - Politecnico di Milano, Italy; Francesco Giacomini, INFN. CNAF., Italy; Juan Miguel de Haro Ruiz, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Francesco Iannone, IENEA, Italy; Daniel Jaschke, lnstitute for Complex Quantum Systems, Ulm University, Germany, INFN, Sezione di Padova, Italy, Dipartimento di Fisica e Astronomia “G. Galilei”, Università degli Studi di Padova, Italy; Daniel Jiménez-González, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Michal Kulczewski, Poznan Supercomputing and Networking Center, Poland; Alberto Leva, DEIB - Politecnico di Milano, Italy; Alessandro Lonardo, INFN, Sezione di Roma, Italy; Michele Martinelli, INFN, Sezione di Roma, Italy; Xavier Martorell, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Simone Montangero, Dipartimento di Fisica e Astronomia “G. Galilei”, Università degli Studi di Padova, Italy, Padua Quantum Technologies Research Center, Italy, INFN, Sezione di Padova, Italy, lnstitute for Complex Quantum Systems, Ulm University, Germany; Lucas Morais, Universitat Politècnica de Catalunya, Spain, Barcelona Supercomputing Center, Spain; Ariel Oleksiak, Poznan Supercomputing and Networking Center, Poland; Paolo Palazzari, IENEA, Italy; Luca Pontisso, INFN, Sezione di Roma, Italy; Federico Reghenzani, DEIB - Politecnico di Milano, Italy, National Research Council (CNR), Italy; Cristian Rossi, INFN, Sezione di Roma, Italy, Università “Sapienza” di Roma, Italy; Sergio Saponarat, University of Pisa, Italy, DEIB - Politecnico di Milano, Italy, Centro Interuniversitario Nazionale per l'Informatica (CINI), Italy; Carlo Saverio Lodi, DEIB - Politecnico di Milano, Italy; Francesco Simula, INFN, Sezione di Roma, Italy; Federico Terraneo, DEIB - Politecnico di Milano, Italy, Centro Interuniversitario Nazionale per l'Informatica (CINI), Italy; Piero Vicini, INFN, Sezione di Roma, Italy; Miquel Vidal, Barcelona Supercomputing Center, Spain; Davide Zoni, DEIB - Politecnico di Milano, Italy; Giuseppe Zummo, IENEA, Italy
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Enabling high-level parallel programming on multi-FPGA clusters

  • De Haro Ruiz, Juan Miguel|||0000-0002-7427-9118
  • Álvarez Martínez, Carlos|||0000-0003-0536-5183
  • Jiménez González, Daniel|||0000-0001-6064-7883
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
Field Programmable Gate Arrays (FPGA) are still relatively new in the High Performance Computing (HPC) field. Hence, they still lack a mature ecosystem that allows non-FPGA experts to scale an application with many devices operating in parallel. In this paper, we add support for message passing inspired by the Message Passing Interface (MPI) to the Marenostrum Exascale Emulation Platform (MEEP) cluster, a state-of-the-art FPGA cluster. We use the OmpSs@FPGA programming model, which allows C/C++ code to run on the FPGA and call functions that behave like the well-known MPI\_Send/Recv. For that, we implement the message passing runtime over the MEEP 100Gb Ethernet network. This network includes a switch connected to the QSFP port of the FPGA cards. The switch enables all-to-all connectivity without adding routers in the FPGA fabric. We also introduce a method to manage FPGAs that are PCIe-hosted by remote CPU nodes. I.e. from any CPU node we can load the bitstream, configure it, and transfer data to FPGAs that are attached to a different node. Finally, we evaluate the bandwidth of FPGA-FPGA, and CPU-FPGA local and remote communication, as well as the performance of benchmarks scaling from 1 to 64 FPGAs using the infrastructure presented in this paper. The benchmarks are N-body, Heat with Gauss-Seidel solver and Cholesky. We compare the results with the MareNostrum 4 supercomputer and get 2.3x and 3.5x better performance per power for the N-body and Heat., We thank the MEEP project [Horizon 2020 grant number 946002] for providing us the FPGA cluster used in this work. This work was supported by the TEXTAROSSA project [Horizon 2020 grant number 956831]; the Spanish Government [grant numbers PCI2021121964, PDC2022-133323-I00, PID2019-107255GB-C21, MICIU/AEI/ 10.13039/501100011033]; and the Generalitat de Catalunya [grant number 2021 SGR 01007]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

HPC-enabled digital twin for modern power networks

  • Prieto Araujo, Eduardo|||0000-0003-4349-5923
  • Rossi, Francesca
  • Olives Camps, Juan Carlos
  • Mateu Barriendos, Elia
  • El Yaagoubi, Soufiane
  • Garrobé Fonollosa, Marcel
  • Bergas Jané, Joan Gabriel|||0000-0003-4317-680X
  • Albernaz Lacerda Freitas, Vinícius|||0000-0001-8648-9027
  • Iraola de Acevedo, Eduardo|||0000-0002-0837-7086
  • García Lorenzo, Mauro
  • Lordan Gomis, Francesc|||0000-0002-9845-8890
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
This article presents the development of a High-Performance Computing-enabled Digital Twin (HPC-DT) as an innovative solution designed to significantly enhance real-time power system management for grid operators. It begins by providing a comprehensive over-view of the HPC-DT architecture, detailing its key components and the technical methodology for integrating the digital twin with actual power systems. Following the architectural discus-sion, the article introduces a suite of specialized tools, many of which leverage the computa-tional power of HPC systems, to illustrate the practical capabilities of the proposed concept., Research projects TED2021-130351B-C21 and TED2021-130351B-C22 are funded by MICIU/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR. The BSC authors are also partially supported by the Spanish Government (PID2019- 107255GB) and MCIN/AEI /10.13039/501100011033 (CEX2021-001148-S), and by the Departament de Recerca i Universitats de la Generalitat de Catalunya, research group MPiEDist (2021 SGR 00412),
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Mix-GEMM: An efficient HW-SW architecture for mixed-precision quantized deep neural networks inference on edge devices

  • Reggiani, Enrico
  • Pappalardo, Alessandro
  • Doblas Font, Max|||0000-0002-8909-3033
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Olivieri, Mauro
  • Unsal, Osman Sabri
  • Cristal Kestelman, Adrián|||0000-0003-1277-9296
  • Barcelona Supercomputing Center
Deep Neural Network (DNN) inference based on quantized narrow-precision integer data represents a promising research direction toward efficient deep learning computations on edge and mobile devices. On one side, recent progress of Quantization-Aware Training (QAT) frameworks aimed at improving the accuracy of extremely quantized DNNs allows achieving results close to Floating-Point 32 (FP32), and provides high flexibility concerning the data sizes selection. Unfortunately, current Central Processing Unit (CPU) architectures and Instruction Set Architectures (ISAs) targeting resource-constrained devices present limitations on the range of data sizes supported to compute DNN kernels.This paper presents Mix-GEMM, a hardware-software co-designed architecture capable of efficiently computing quantized DNN convolutional kernels based on byte and sub-byte data sizes. Mix-GEMM accelerates General Matrix Multiplication (GEMM), representing the core kernel of DNNs, supporting all data size combinations from 8- to 2-bit, including mixed-precision computations, and featuring performance that scale with the decreasing of the computational data sizes. Our experimental evaluation, performed on representative quantized Convolutional Neural Networks (CNNs), shows that a RISC-V based edge System-on-Chip (SoC) integrating Mix-GEMM achieves up to 1.3 TOPS/W in energy efficiency, and up to 13.6 GOPS in throughput, gaining from 5.3× to 15.1× in performance over the OpenBLAS GEMM frameworks running on a commercial RISC-V based edge processor. By performing synthesis and Place and Route (PnR) of the enhanced SoC in Global Foundries 22nm FDX technology, we show that Mix-GEMM only accounts for 1% of the overall area consumption., This research was supported by the ERDF Operational Program of Catalonia 2014-2020, with a grant from the Spanish State Research Agency [PID2019-107255GB] and with DRAC project [001-P-001723], by the grant [PID2019-107255G-C21] funded by MCIN/AEI/ 10.13039/501100011033, by the Generalitat de Catalunya [2017-SGR-1328], and by Lenovo-BSC Contract-Framework (2020). The Spanish Ministry of Economy, Industry and Competitiveness has partially supported M. Doblas through an FPU fellowship [FPU20-04076] and M. Moreto through a Ramon y Cajal fellowship [RYC-2016-21104]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Extending sparse patterns to improve inverse preconditioning on GPU architectures

  • Laut Turón, Sergi
  • Borrell Pol, Ricard
  • Casas, Marc|||0000-0003-4564-2093
Graphic Processing Units (GPUs) have become a key component of high-end computing infrastructures due to their massively parallel architecture, which delivers large floating-point operations per cycle rates. Many scientific workloads benefit from GPUs and, in particular, numerical methods solving linear systems of equations $Ax=b$ typically run on GPUs. Among them, the Conjugate Gradient (CG) method, which targets linear systems with Symmetric and Positive Definite (SPD) matrices, runs on GPUs using its preconditioned form. However, state-of-the-art preconditioning techniques like the Factorized Sparse Approximate Inverse (FSAI) preconditioner ignore the benefits of data coalescence and locality on GPU architectures and leave substantial performance on the table. These approaches are exclusively based on numerical criteria. This paper proposes the GPU-aware Factorized Sparse Approximate Inverse (GFSAI) preconditioner. GFSAI generates sparse patterns that enhance the numerical benefits of FSAI and improve data locality and coalescence on GPU architectures. We evaluate GFSAI considering NVIDIA V100 and AMD MI50 GPUs and a set of 47 sparse matrices. GFSAI improves the state-of-the-art by reducing the average CG iteration count by 27.48\% and 31.25\% on NVIDIA and AMD, respectively, which leads to average decreases in execution time of 23.83\% and 26.07\% in these two GPU architectures., Marc Casas has been partially supported by Grant RYC-2017- 23269, which is funded by MCIN/AEI/10.13039/501100011033 and ESF Investing in your future. This research was supported by grant PID2019-107255GB-C21 funded by MCIN/AEI/10.13039/501100011033. The authors thank the Departament de Recerca i Universitats de la Generalitat de Catalunya for supporting the Research Group "Performance understanding, analysis, and simulation/emulation of novel architectures" (Code: 2021 SGR 00865), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Accelerating SpMV on FPGAs through block-row compress: a task-based approach

  • Oliver Segura, José
  • Álvarez Martínez, Carlos|||0000-0003-0536-5183
  • Cervero García, Teresa
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Davis, John D.
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
Sparse Matrix-Vector multiplication (SpMV), computing y=α⋅A×x+β⋅y where y,x are dense vectors, α,β two scalar constants, and A is a sparse matrix, is a key kernel in many HPC applications. It exhibits a kind of memory access that is extremely hard to perform efficiently, due to its random access. In this paper, we present a new approach to accelerate SpMV on FPGAs. As FPGAs lack a default memory hierarchy, they can adapt to specific applications better. Also, an increasing number of FPGAs include High Bandwidth Memory (HBM), making the SpMV problem especially appealing to tackle on these kind of devices. We define a new sparse matrix encoding format (b8c) and its corresponding SpMV implementation using OmpSs@FPGA and HLS. This format allows us to leverage many of the FPGA strengths for intensive data processing, such as data streaming, customizable datapaths widths, parallel memory access for off-chip memory in the case of multiple memory channels (like in HBM), parallel memory access for on-chip memory and pipelining. We tested our proposal for both DDR and HBM memories to show the adaptability and scalability of our design. The presented b8c SpMV implementation is able to achieve higher performance than the state-of-the-art FPGA implementation of SpMV over all the matrices in the data set, achieving 3.52x performance on average with a minimum of 1.82x and a maximum of 6.28x even when running at 75% the frequency., This work has received funding from the MEEP project (European High-Performance Computing Joint Undertaking (JU) under grant agreement No 946002), from ”Lenovo-BSC Contract-Framework (2022)”, from the Spanish Government (PID2019-107255GB-C21/AEI /10.13039/501100011033, CEX2021-001148-S funded by MCIN/AEI / 10.13039/501100011033), and from Generalitat de Catalunya (contract 2021-SGR-01007)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

On Neural Networks Redundancy and Diversity for Their Use in Safety-Critical Systems

  • Brando, Axel
  • Serra, Isabel
  • Mezzetti, Enrico|||0000-0002-1886-2931
  • Cazorla Almeida, Francisco Javier
  • Perez Cerrolaza, Jon
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
An increasing number of critical functionalities integrated in embedded critical systems rely on deep learning (DL) technology. This article summarizes certain key aspects of DL’s intrinsic stochastic and training-data-dependent nature that are at odds with current domain-specific functional safety standards. We exemplify how redundancy and diversity of neural networks can help to reconcile DL technology and functional safety requirements., The research leading to these results has received funding from the European Research Council (ERC) grant agreement No. 772773 (SuPerCom), the Horizon Europe Programme under the SAFEXPLAIN Project (www.safexplain.eu), grant agreement num.101069595, and the Spanish Ministry of Science and Innovation under grant PID2019-107255GBC21/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Colony: Parallel functions as a service on the cloud-edge continuum

  • Lordan Gomis, Francesc|||0000-0002-9845-8890
  • Lezzi, Daniele|||0000-0001-5081-7244
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
Although smart devices markets are increasing their sales figures, their computing capabilities are not sufficient to provide good-enough-quality services. This paper proposes a solution to organize the devices within the Cloud-Edge Continuum in such a way that each one, as an autonomous individual –Agent–, processes events/data on its embedded compute resources while offering its computing capacity to the rest of the infrastructure in a Function-as-a-Service manner. Unlike other FaaS solutions, the described approach proposes to transparently convert the logic of such functions into task-based workflows backing on task-based programming models; thus, agents hosting the execution of the method generate the corresponding workflow and offloading part of the workload onto other agents to improve the overall service performance. On our prototype, the function-to-workflow transformation is performed by COMPSs; thus, developers can efficiently code applications of any of the three envisaged computing scenarios – sense-process-actuate, streaming and batch processing – throughout the whole Cloud-Edge Continuum without struggling with different frameworks specifically designed for each of them., This work has been supported by the Spanish Government (PID2019-107255GB), by Generalitat de Catalunya (contract 2014-SGR-1051), and by the European Commission through the Horizon 2020 Research and Innovation program under Grant Agreement No. 101016577 (AI-SPRINT project)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Exploiting vector code semantics for efficient data cache prefetching

  • Martínez Palau, Francesc
  • Torrents Lapuerta, Martí
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Casas, Marc|||0000-0003-4564-2093
Emerging workloads from domains like high performance computing, data analytics or deep learning consume large amounts of memory bandwidth. To mitigate this problem, computing systems include large and deep memory cache hierarchies that exploit both spatial and temporal locality. In this context, hardware data cache prefetching constitutes a useful method to anticipate cache misses and boost performance. Despite their success in terms of high coverage rates, current data cache prefetchers incur a significant number of late and sometimes useless prefetches. Additionally, these state-of-the-art prefetchers are not aware of architecture trends towards larger vector units and vector-length agnostic instruction sets. This paper demonstrates that these trends bring new prefetching opportunities that make it possible to increase the accuracy and timeliness of any state-of-the-art prefetcher with a negligible area cost. We propose the the Register Vector Length Agnostic (ReVeLA) prefetcher. ReVeLA exploits program semantics present in vectorized codes. The ReVeLA prefetcher complements existing data cache prefetchers by providing highly accurate prefetch requests that improve prefetching timeliness and accuracy without significantly increasing memory bandwidth consumption. When applied on top of a state-of-the-art out-of-order vector processor, ReVeLA delivers a speed-up of 1.23 × with respect to a system without any prefetching approach. When combined with the NextLine, BOP, SPP, and PPF prefetchers, ReVeLA improves performance by 6.57%, 4.46%, 11.83%, and 11.40% respectively, with respect to a vector processor equipped with these prefetching approaches. Additionally, our evaluation demonstrates that ReVeLA increases memory bandwidth consumption by only 3.74% when combined with the most performing data cache prefetcher of our experimental campaign., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contract PID2019-107255GB-C21) and ESF Investing in your future, the Generalitat of Catalunya (contract 2021-SGR-00763), the European HiPEAC Network of Excellence, and the European Processor Initiative (EPI), which is part of the European Union’s Horizon 2020 research and innovation program under grant agreement No. 826647. A. Armejach is a Serra Hunter Fellow. The authors thank the Departament de Recerca i Universitats de la Generalitat de Catalunya for supporting the Research Group "Performance understanding, analysis, and simulation/emulation of novel architectures" (Code: 2021 SGR 00865)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Dynamic resource allocation for efficient parallel CFD simulations

  • Houzeaux, Guillaume|||0000-0002-2592-1426
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Borrell Pol, Ricard
  • Dosimont, Damien
  • Ejarque Artigas, Jorge
  • Garcia Gasulla, Marta|||0000-0003-3682-9905
  • López Herrero, Víctor
CFD users of supercomputers usually resort to rule-of-thumb methods to select the number of subdomains (partitions) when relying on MPI-based parallelization. One common approach is to set a minimum number of elements or cells per subdomain, under which the parallel efficiency of the code is “known” to fall below a subjective level, say 80%. The situation is even worse when the user is not aware of the “good” practices for the given code and a huge amount of resources can thus be wasted. This work presents an elastic computing methodology that adapts at runtime the resources allocated to a simulation automatically. The criterion to control the required resources is based on a runtime measure of the communication efficiency of the execution. According to some analytical estimates, the resources are then expanded or reduced to fulfill this criterion and eventually execute an efficient simulation., This work has been supported by the Spanish Government (PID2019- 107255GB); by Generalitat de Catalunya (contract 2014-SGR-1051); by the European Commission H2020 project POP CoE (GA n. 824080); by the European Commission H2020 project CompBioMed CoE (GA n. 823712) and by the European Commission and the EuroHPC JU under contract 955558 (eFlows4HPC project)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Applying a task-based approach to distributed machine learning workflows

  • Vázquez Novoa, Fernando
  • Lezzi, Daniele|||0000-0001-5081-7244
  • Lordan Gomis, Francesc|||0000-0002-9845-8890
  • Baghdadi, Fatemeh
  • Cirillo, Davide|||0000-0003-4982-4716
The growing demands across various scientific fields have led to a significant shift in applications that consume data at the edge of the computing continuum. These applications require unified programming models for the composition of components and coordinating the execution of computational workloads, including training machine learning (ML) models on distributed resources. Personalized healthcare often leverages data generated from wearable devices used to train ML models, can be benefited from distributed computing approaches. Specifically, stroke care can be greatly benefited from distributed ML with modifiable risk factors that can be monitored using wearable devices. In this work, we present an implementation that leverages distributed techniques for large-scale ML workflows using electrocardiogram (ECG) recordings for atrial fibrillation (AF) classification. The application was evaluated using the PhysioNet database, showcasing the potential of distributed, ML in stroke care, opening the way for future creation of more advanced models embedded in edge devices., Author Fernando Vázquez is supported by PRE2022- 104134 funded by MICIU/AEI /10.13039/501100011033 and by the FSE+. This work has been supported by the Spanish Government (PID2019-107255GB) and by MCIN/AEI /10.13039/501100011033 (CEX2021-001148-S), by Generalitat de Catalunya (contract 2021-SGR-00412), and by the European Commission through the Horizon Europe Research and Innovation program under Grant Agreement 101016577 (AI-SPRINT project)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Transparent load balancing of MPI programs using OmpSs-2@Cluster and DLB

  • Aguilar Mena, Jimmy|||0000-0001-6802-2247
  • Ali, Omar Shaaban Ibrahim
  • López Herrero, Víctor
  • Garcia Casulla, Marta
  • Carpenter, Paul Matthew
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
Load imbalance is a long-standing source of inefficiency in high performance computing. The situation has only got worse as applications and systems increase in complexity, e.g., adaptive mesh refinement, DVFS, memory hierarchies, power and thermal management, and manufacturing processes. Load balancing is often implemented in the application, but it obscures application logic and may need extensive code refactoring. This paper presents an automated and transparent dynamic load balancing approach for MPI applications with OmpSs-2 tasks, which relieves applications from this burden. Only local and trivial changes are required to the application. Our approach exploits the ability of OmpSs-2@Cluster to offload tasks for execution on other nodes, and it reallocates compute resources among ranks using the Dynamic Load Balancing~(DLB) library. It employs LeWI to react to fine-grained load imbalances and DROM to address coarse-grained load imbalances by reserving cores on other nodes that can be reclaimed on demand. We use an expander graph to limit the amount of point-to-point communication and state. The results show 46% reduction in time-to-solution for micro-scale solid mechanics on 32 nodes and a 20% reduction beyond DLB for $n$-body on 16 nodes, when one node is running slow. A synthetic benchmark shows that performance is within 10% of optimal for an imbalance of up to 2.0 on 8 nodes. All software is released open source., This research has received funding from the European Union’s Horizon 2020/EuroHPC research and innovation programme under grant agreement No 955606 (DEEP-SEA) and 754337 (EuroEXA). It is supported by the Spanish State Research Agency - Ministry of Science and Innovation (contract PID2019-107255GB and Ramon y Cajal fellowship RYC2018-025628-I) and by the Generalitat de Catalunya (2017-SGR-1414)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of SYCL’s suitability for high-performance critical systems

  • Peralta Quesada, Cristina
  • Trompouki, Matina Maria
  • Kosmidis, Leonidas
Upcoming safety critical systems require high performance processing, which can be provided by multi-cores and embedded GPUs found in several Systems-on-chip (SoC) targeting these domains. So far, only low-level programming models and APIs, such as CUDA or OpenCL have been evaluated. In this paper, we evaluate the effectiveness of a higher level programming model, SYCL, for critical applications executed in such embedded platforms. In particular, we are interested in two aspects: performance and programmability. In order to conduct our study, we use the open source GPU4S Bench benchmarking suite for space and an open source pedestrian detection application representing the automotive sector, which we port into SYCL and analyse their behavior. We perform our evaluation on a high-performance platform featuring an NVIDIA GTX 1080Ti as well as a representative embedded platform, the NVIDIA Xavier AGX which is considered a good candidate for future safety critical systems in both domains and we compare our results with other programming models. Our results show that in several cases SYCL is able to obtain performance close to highly optimised code using CUDA or NVIDIA libraries, with significantly lower development effort and complexity, which confirms the suitability of SYCL for programming high-performance safety critical systems., This work was funded by the Ministerio de Ciencia e Innovacion - Agencia Estatal de Investigacion (PID2019-107255GB-C21 and IJC-2020-045931-I MCIN/AEI/10.13039/501100011033), the European Commission’s Horizon 2020 programme under the UP2DATE project (grant agreement 871465) and the HiPEAC Network of Excellence., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Storage-heterogeneity aware task-based programming models to optimize I/O intensive applications

  • Elshazly, Hatem Mohamed Abdelfattah Eid|||0000-0002-8591-1502
  • Ejarque Artigas, Jorge
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
Task-based programming models have enabled the optimized execution of the computation workloads of applications. These programming models can take advantage of large-scale distributed infrastructures by allowing the parallel and distributed execution of applications in high-level work components called tasks. Nevertheless, in the era of Big Data and Exascale, the amount of data produced by modern scientific applications has already surpassed terabytes and is rapidly increasing. Hence, I/O performance became the bottleneck to overcome in order to achieve more total performance improvement. New storage technologies offer higher bandwidth and faster solutions than traditional Parallel File Systems (PFS). Such storage devices are deployed in modern day infrastructures to boost I/O performance by offering a fast layer that absorbs the generated data. Therefore, it is necessary for any programming model targeting more performance to manage this heterogeneity and take advantage of it to improve the I/O performance of applications. Towards this goal, we propose in this paper a set of programming model capabilities that we refer to as Storage-Heterogeneity Awareness. Such capabilities include: (i) abstracting the heterogeneity of storage systems, and (ii) optimizing I/O performance by supporting dedicated I/O schedulers and an automatic data flushing technique. The evaluation section of this paper presents the performance results of different applications on the MareNostrum CTE-Power heterogeneous storage cluster. Our experiments demonstrate that a storage-heterogeneity aware programming model can achieve up to almost 5x I/O performance speedup and 48% total time improvement compared to the reference PFS-based usage of the execution infrastructure., This work is partially supported by the European Union through the Horizon 2020 research and innovation programme under contracts 721865 (EXPERTISE Project) by the Spanish Government (PID2019-107255GB) and the Generalitat de Catalunya (contract 2014-SGR-1051)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Vector extensions in COTS processors to increase guaranteed performance in real-time systems

  • Pujol Torramorell, Roger
  • Jorba Jorba, Josep
  • Tabani, Hamid
  • Kosmidis, Leonidas
  • Mezzetti, Enrico|||0000-0002-1886-2931
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Cazorla Almeida, Francisco Javier
The need for increased application performance in high-integrity systems like those in avionics is on the rise as software continues to implement more complex functionalities. The prevalent computing solution for future high-integrity embedded products are multi-processors systems-on-chip (MPSoC) processors. MPSoCs include CPU multicores that enable improving performance via thread-level parallelism. MPSoCs also include generic accelerators (GPUs) and application-specific accelerators. However, the data processing approach (DPA) required to exploit each of these underlying parallel hardware blocks carries several open challenges to enable the safe deployment in high-integrity domains. The main challenges include the qualification of its associated runtime system and the difficulties in analyzing programs deploying the DPA with out-of-the-box timing analysis and code coverage tools. In this work, we perform a thorough analysis of vector extensions (VExt) in current COTS processors for high-integrity systems. We show that VExt prevent many of the challenges arising with parallel programming models and GPUs. Unlike other DPAs, VExt require no runtime support, prevent by design race conditions that might arise with parallel programming models, and have minimum impact on the software ecosystem enabling the use of existing code coverage and timing analysis tools. We develop vectorized versions of neural network kernels and show that the NVIDIA Xavier VExt provide a reasonable increase in guaranteed application performance of up to 2.7x. Our analysis contends that VExt are the DPA approach with arguably the fastest path for adoption in high-integrity systems., This work has received funding from the the European Research Council (ERC) grant agreement No. 772773 (SuPerCom) and the Spanish Ministry of Science and Innovation (AEI/10.13039/501100011033) under grants PID2019-107255GB-C21 and IJC2020-045931-I., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Automatic aggregation of subtask accesses for nested OpenMP-style tasks

  • Ali, Omar Shaaban Ibrahim
  • Aguilar Mena, Jimmy|||0000-0001-6802-2247
  • Beltran Querol, Vicenç
  • Carpenter, Paul Matthew
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
Task-based programming is a high performance and productive model to express parallelism. Tasks encapsulate work to be executed across multiple cores or offloaded to GPUs, FPGAs, other accelerators or other nodes. In order to maintain parallelism and afford maximum freedom to the scheduler, the task dependency graph should be created in parallel and well in advance of task execution. A key limitation with OpenMP and OmpSs-2 tasking is that a task cannot be created until all its accesses and its descendents' accesses are known. Current approaches to work around this limitation either stop task creation and execution using a taskwait or they substitute “fake” accesses known as sentinels. This paper proposes the auto clause, which indicates that the task may create subtasks that access unspecified memory regions or it may allocate and return memory at addresses that are of course not yet known. Unlike approaches using taskwaits, there is no interruption to the concurrent creation and execution of tasks, maintaining parallelism and the scheduler's ability to optimize load balance and data locality. Unlike existing approaches using sentinels, all tasks can be given a precise specification of their own data accesses, so that a single mechanism is used to control task ordering, program data transfers on distributed memory and optimize data locality, e.g. on NUMA systems. The auto clause also provides an incremental path to develop programs with nested tasks, by removing the need for every parent task to have a complete specification of the accesses of its descendent tasks. This is redundant information that can be time consuming and error-prone to describe. We present a straightforward runtime implementation that achieves a 1.4 times speedup for n-body with OmpSs-2@Cluster task offloading to 32 nodes and <4% slowdown for three benchmarks with task offloading to 8 nodes. All code is open source., This research has received funding from the European Unions Horizon 2020/EuroHPC research and innovation programme under grant agreement No 955606 (DEEP- SEA) and 754337 (EuroEXA). It is supported by the Spanish State Research Agency - Ministry of Science and Innovation (contract PID2019-107255GB- C21/MCIN/AEI/10.13039/501100011033 and Ramon y Cajal fellowship RYC2018-025628-I/MCIN/AEI/ 10.13039/501100011033 and by “ESF Investing in your future”), as well as by the Generalitat de Catalunya (2017-SGR-1414)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Contention tracking in GPU last-level cache

  • Barrera Herrera, Javier Enrique|||0000-0003-1469-2514
  • Kosmidis, Leonidas
  • Tabani, Hamid
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Cazorla Almeida, Francisco Javier
The Last-level cache (LLC) is one of the main GPU’s shared resources that contributes to improve performance but also increases individual kernel’s performance variability. This is detrimental in scenarios in which some level of performance predictability is required. While predictability can be regained by deploying cache partitioning (isolation) mechanisms, isolation negatively affects performance efficiency. This work shows that not partitioning the LLC and providing the ability to track the contention that kernels generate on each other allows them to share LLC space, hence increasing efficiency, while the system designer obtains a clear view of how each kernel affects each other in the LLC so as to balance performance and predictability goals. In this line, we propose GPU demotion counters (GDC), a low-overhead hardware mechanism to track contention that kernels generate on each other in the shared LLC., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC-2020- 045931-I funded by MCIN/AEI/ 10.13039/501100011033 and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 772773)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Securing the Execution of ML Workflows across the Compute Continua

  • Lordan Gomis, Francesc-Josep
  • Martin, André
  • Lezzi, Daniele|||0000-0001-5081-7244
Cloud computing has become the major computational paradigm for the deployment of all kind of applications, ranging from mobile apps to complex AI algorithms. On the other side, the rapid growth of IoT market has led to the need of processing the data produced by smart devices using their embedded resources. The computing continuum paradigm aims at solving the issues related to the deployment of applications across edge-to-cloud cyber-infrastructures.This work considers in-memory data protection to enhance security over the compute continua and proposes a solution for the development of distributed applications that handles security in a transparent way for the developer. The proposed framework has been evaluated using an ML application that classifies health data using a pre-trained model. The results show that securing in-memory data incurs no additional effort at development time and the overheads introduced by the encryption mechanisms do not compromise the scalability of the application., This work has been supported by the Spanish Government (PID2019-107255GB) and by MCIN/AEI /10.13039/501100011033 (CEX2021- 001148-S), by Generalitat de Catalunya (contract 2021-SGR-00412),and by the European Commission through the Horizon Europe Research and Innovation program under Grant Agreement No.101016577 (AI-SPRINT project)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

DynAMO: Improving parallelism through dynamic placement of atomic memory operations

  • Soria Pardos, Víctor
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Mück, Tiago
  • Suárez Gracía, Dario
  • Joao, Jose A.
  • Rico, Alejandro
  • Moretó Planas, Miquel|||0000-0002-9848-8758
With increasing core counts in modern multi-core designs, the overhead of synchronization jeopardizes the scalability and efficiency of parallel applications. To mitigate these overheads, modern cache-coherent protocols offer support for Atomic Memory Operations (AMOs) that can be executed near-core (near) or remotely in the on-chip memory hierarchy (far). This paper evaluates current available static AMO execution policies implemented in multi-core Systems-on-Chip (SoC) designs, which select AMOs' execution placement (near or far) based on the cache block coherence state. We propose three static policies and show that the performance of static policies is application dependent. Moreover, we show that one of our proposed static policies outperforms currently available implementations. Furthermore, we propose DynAMO, a predictor that selects the best location to execute the AMOs. DynAMO identifies the different locality patterns to make informed decisions, improving AMO latency and increasing overall throughput. DynAMO outperforms the best-performing static policy and provides geometric mean speed-ups of 1.09× across all workloads and 1.31× on AMO-intensive applications with respect to executing all AMOs near., This research was supported by the Spanish Ministry of Science and Innovation (MCIN) through contracts [PID2019-107255GB-C21], [TED2021-132634A-I00], and [PID2019-105660RB-C21]; the Generalitat of Catalunya through contract [2021-SGR-00763]; the Government of Aragon [T5820R]; the Arm-BSC Center of Excellence, and the European Processor Initiative (EPI) which is part of the European Union’s Horizon 2020 research and innovation program under grant agreement No. 826647. V. Soria-Pardos has been supported through an FPU fellowship [FPU20-02132]; A. Armejach is a Serra Hunter Fellow and has been partially supported by the Grant [IJCI-2017-33945] funded by MCIN/AEI/10.13039/501100011033; M. Moreto through a Ramón y Cajal fellowship [RYC-2016-21104]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Worst case execution time and power estimation of multicore and GPU software: a pedestrian detection use case

  • Rodríguez Ferrández, Iván
  • Jover Álvarez, Álvaro
  • Trompouki, Matina Maria
  • Kosmidis, Leonidas
  • Cazorla Almeida, Francisco Javier
Worst Case Execution Time estimation of software running on parallel platforms is a challenging task, due to resource interference of other tasks and the complexity of the underlying CPU and GPU hardware architectures. Similarly, the increased complexity of the hardware, challenges the estimation of worst case power consumption. In this paper, we employ Measurement Based Probabilistic Timing Analysis (MBPTA), which is capable of managing complex architectures such as multicores. We enable its use by software randomisation, which we show for the first time that is also possible on GPUs. We demonstrate our method on a pedestrian detection use case on an embedded multicore and GPU platform for the automotive domain, the NVIDIA Xavier. Moreover, we extend our measurement based probabilistic method in order to predict the worst case power consumption of the software on the same platform., This work was funded by the Ministerio de Ciencia e Innovación - Agencia Estatal de Investigación (PID2019-107255GB- C21/AEI/10.13039/501100011033 and IJC-2020-045931-I), the European Commission’s Horizon 2020 programme under the UP2DATE project (grant agreement 871465), an ERC grant (No. 772773) and the HiPEAC Network of Excellence, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

FPGA framework improvements for HPC applications

  • Filgueras Izquierdo, Antonio|||0000-0001-6071-3254
  • Vidal, Miquel|||0000-0002-1973-8289
  • Jiménez González, Daniel|||0000-0001-6064-7883
  • Álvarez Martínez, Carlos|||0000-0003-0536-5183
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
In modern FPGA devices, place and route has become an increasingly difficult task due to an increase in resources and device complexity. This results in an exponential increase of implementation possibilities. Such a huge search space causes tools to have a hard time providing a good solution. This is even more challenging in chiplet-based devices due to their topology. In the same way, off-chip memory resources have grown both in size and number of modules. These resources are presented to the user as raw memory interfaces requiring the user to manage how accelerator kernels access off-chip memory to make effective use of the available bandwidth. Efficient usage of memory resources becomes a critical challenge as the more computational resources are added to a design the more pressure they impose on the memory subsystem. This work proposes new features to the OmpSs@FPGA programming model in order to mitigate these issues in a transparent way for programmers., This work is supported by the TEXTAROSSA project G.A. n.956831, as part of the EuroHPC initiative, by the Spanish Government (Grants PCI2021-121964-TEXTAROSSA, PID2019-107255GB-C21 MCIN/AEI/10.13039/501100011033, and CEX2021-001148- S), and by Generalitat de Catalunya (2021 SGR 01007)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Acceleration of synthetic aperture radar for on-board space systems

  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Rodríguez Ferrández, Iván
  • Steenari, David
  • Kosmidis, Leonidas
There is an increasing trend in modern space systems to move processing that until now was transmitted to ground for processing, on board the satellite. Synthetic Aperture Radar (SAR) is an example of such processing. However, such a computationally intensive task requires high performance hardware. In this paper we present the CPU and GPU acceleration of an on-board SAR processing application, part of ESA's open source benchmarking suite OBPMark. We benchmark several embedded multicore and GPU platforms which are promising candidates for future on-board systems. Our results show that both embedded multicores and especially GPUs can provide significant speedups in this type of processing, and can achieve performance levels similar to the ones of high performance ground stations., This work was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments” and the GPU4S (GPU for Space) ESA-funded project. Moreover, it was supported by the European Union’s Horizon Europe programme under the METASAT project (grant agreement 101082622). It was also partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GBC21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Espanola de Investigación (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

QuickEd: high-performance exact sequence alignment based on bound-and-align

  • Doblas Font, Max|||0000-0002-8909-3033
  • Lostes Cazorla, Óscar|||0000-0001-5166-3806
  • Aguado Puig, Quim|||0000-0003-4871-3192
  • Iñiguez Rodríguez, Cristian
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Marco Sola, Santiago|||0000-0001-7951-3914
Motivation: Pairwise sequence alignment is a core component of multiple sequencing-data analysis tools. Recent advancements in sequencing technologies have enabled the generation of longer sequences at a much lower price. Thus, long-read sequencing technologies have become increasingly popular in sequencing-based studies. However, classical sequence analysis algorithms face significant scalability challenges when aligning long sequences. As a result, several heuristic methods have been developed to improve performance at the expense of accuracy, as they often fail to produce the optimal alignment. Results: This paper introduces QuickEd, a sequence alignment algorithm based on a bound-and-align strategy. First, QuickEd effectively bounds the maximum alignment-score using efficient heuristic strategies. Then, QuickEd utilizes this bound to reduce the computations required to produce the optimal alignment. Compared to Oðn2Þ complexity of traditional dynamic programming algorithms, QuickEd’s bound-and-align strategy achieves OðnbsÞ complexity, where n is the sequence length and bs is an estimated upper bound of the alignment-score between the sequences. As a result, QuickEd is consistently faster than other state-of-the-art implementations, such as Edlib and BiWFA, achieving performance speedups of 4:2-5:9× and 3:8-4:4×, respectively, aligning long and noisy datasets. In addition, QuickEd maintains a stable memory footprint below 35 MB while aligning sequences up to 1 Mbp. Availability and implementation: QuickEd code and documentation are publicly available at https://github.com/maxdoblas/QuickEd., This work was partially funded by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 and FSEþ [PID2019-107255GB-C21, PID2020-113614RBC21, TED2021-132634A-I00, and PRE2021-101059 to Q. A.-P.], the Spanish Ministry of Economy, Industry, and Competitiveness through an FPU fellowship [FPU20-04076 to M.D.], the Spanish Ministry, Ministerio para la Transformación Digital y de la Función Pública, and the European Union – NextGenerationEU through the Cátedra Chip UPC project [TSI-069100-2023-0015], Lenovo-BSC Contract-Framework Contract (2020), and the Generalitat de Catalunya GenCat-DIUiE (GRR) [2017-SGR-313, 2017- SGR-1328, 2017-SGR-1414, 2021-SGR-00763, and 2021- SGR-00574]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A symbolic emulator for shuffle synthesis on the NVIDIA PTX code

  • Matsumura, Kazuaki
  • García de Gonzalo, Simón
  • Peña Monferrer, Antonio José
Various kinds of applications take advantage of GPUs through automation tools that attempt to automatically exploit the available performance of the GPU's parallel architecture. Directive-based programming models, such as OpenACC, are one such method that easily enables parallel computing by just adhering code annotations to code loops. Such abstract models, however, often prevent programmers from making additional low-level optimizations to take advantage of the advanced architectural features of GPUs because the actual generated computation is hidden from the application developer. This paper describes and implements a novel flexible optimization technique that operates by inserting a code emulator phase to the tail-end of the compilation pipeline. Our tool emulates the generated code using symbolic analysis by substituting dynamic information and thus allowing for further low-level code optimizations to be applied. We implement our tool to support both CUDA and OpenACC directives as the frontend of the compilation pipeline, thus enabling low-level GPU optimizations for OpenACC that were not previously possible. We demonstrate the capabilities of our tool by automating warp-level shuffle instructions that are difficult to use by even advanced GPU programmers. Lastly, evaluating our tool with a benchmark suite and complex application code, we provide a detailed study to assess the benefits of shuffle instructions across four generations of GPU architectures., We are funded by the EPEEC project from the European Union’s Horizon 2020 research and innovation program under grant agreement No. 801051 and the Ministerio de Ciencia e Innovación-Agencia Estatal de Investigación (PID2019-107255GB-C21/AEI/10.13039/501100011033). This work has been partially carried out on the ACME cluster owned by CIEMAT and funded by the Spanish Ministry of Economy and Competitiveness project CODEC-OSE (RTI2018-096006-B-I00)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Extreme-scale workflows: a perspective from the JLESC international community

  • Yildiz, Orcun
  • Gueroudji, Amal
  • Bigot, Julien
  • Raffin, Bruno
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Peterka, Tom
The Joint Laboratory for Extreme-Scale Computing (JLESC) focuses on software challenges in high-performance computing systems to meet the needs of today’s science campaigns, which often require large resources, consist of multiple tasks, and generate vast amounts of data. In this context, extreme-scale workflows have been the key factor in enabling scientific discoveries by helping scientists automate the dependencies and data exchanges between workflow tasks, instead of managing those manually. In this paper we present representative extreme-scale workflows and feature workflow systems developed by JLESC participating institutions. We present lessons learned while developing these tools, alongside with the open challenges and future research directions in the field of extreme-scale workflows., This research is supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, under contract number DE-AC02- 06CH11357, program manager Margaret Lentz. The BSC author acknowledges the support of the Spanish Government (PID2019-107255GB) and by MCIN/AEI /10.13039 /501100011033 (CEX2021-001148-S), by the Departament de Recerca i Universitats de la Generalitat de Catalunya to the Research Group MPiEDist (2021 SGR 00412). The same author acknowledges the European Commission’s Horizon 2020 Framework program and the European High-Performance Computing Joint Undertaking (JU) under grant agreement No. 955558 and by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR (PCI2021-121957), project eFlows4HPC. The INRIA author acknowledges the European Union’s Horizon research and innovation programme under grant agreement No 101144014., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

End-to-end QoS for the open source safety-relevant RISC-V SELENE platform

  • Andreu Cerezo, Pablo
  • Hernández Luz, Carles
  • Picornell Sanjuan, Tomás
  • López Rodríguez, Pedro
  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Bas Jalón, Francisco
  • Benedicte Illescas, Pedro|||0000-0003-1670-7783
  • Chang, Feng
  • Cabo Pitarch, Guillem
  • Fuentes Díaz, Francisco Javier
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
This paper presents the end-to-end QoS approach to provide performance guarantees followed in the SELENEplatform, a high-performance RISC-V based heterogeneous SoC for safety-related real-time systems. Our QoS approach includes smart interconnect solutions for buses and NoCs, along with multicore interference-aware statistics units to, cooperatively, achieve end-to-end QoS., This work has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 871467. BSC work has also been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB-C21/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

SafeX: Open source hardware and software components for safety-critical systems

  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Cabo Pitarch, Guillem
  • Bas Jalón, Francisco
  • Benedicte Illescas, Pedro|||0000-0003-1670-7783
  • Fuentes Díaz, Francisco Javier
  • Chang, Feng
  • Lasfar, Ilham
  • Canal Corretger, Ramon|||0000-0003-4542-204X
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
RISC-V Instruction Set Architecture (ISA) emerges as an opportunity to develop open source hardware without being subject to expensive licenses or export restrictions. A plethora of initiatives are nowadays developing systems-on-chip (SoCs) and its components based on RISC-V targeting a wide variety of markets. However, domains with safety requirements, such as avionics, space, and automotive, impose SoCs to include support to meet those requirements.This work introduces the SafeX family of components, a set of components providing SoC controllability, observability and safety measures support. These components, developed by the Barcelona Supercomputing Center with permissive open source licenses, are intended to be the basis to make SoCs meet the needs of domains with safety requirements. In particular, the SafeX components developed so far include the SafeSU (multicore statistics unit), the SafeTI (flexible and programmable traffic injector), the SafeDE and SafeSoftDR (hardware and software modules to enforce lockstep execution), and the SafeDM (module to monitor diversity across cores)., This work has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 871467. This work has also been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB-C21 funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

SAFEXPLAIN: Safe and Explainable Critical Embedded Systems Based on AI

  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Perez, Jon
  • Englund, Cristofer
  • Zonooz, Bahram
  • Giordana, Gabriele
  • Cazorla Almeida, Francisco Javier
  • Mezzetti, Enrico|||0000-0002-1886-2931
  • Serra, Isabel
  • Brando, Axel
Deep Learning (DL) techniques are at the heart of most future advanced software functions in Critical Autonomous AI-based Systems (CAIS), where they also represent a major competitive factor. Hence, the economic success of CAIS industries (e.g., automotive, space, railway) depends on their ability to design, implement, qualify, and certify DL-based software products under bounded effort/cost. However, there is a fundamental gap between Functional Safety (FUSA) requirements on CAIS and the nature of DL solutions. This gap stems from the development process of DL libraries and affects high-level safety concepts such as (1) explainability and traceability, (2) suitability for varying safety requirements, (3) FUSA-compliant implementations, and (4) real-time constraints. As a matter of fact, the data-dependent and stochastic nature of DL algorithms clashes with current FUSA practice, which instead builds on deterministic, verifiable, and pass/fail test-based software. The SAFEXPLAIN project tackles these challenges and targets by providing a flexible approach to allow the certification - hence adoption - of DL-based solutions in CAIS building on: (1) DL solutions that provide end-to-end traceability, with specific approaches to explain whether predictions can be trusted and strategies to reach (and prove) correct operation, in accordance to certification standards; (2) alternative and increasingly sophisticated design safety patterns for DL with varying criticality and fault tolerance requirements; (3) DL library implementations that adhere to safety requirements; and (4) computing platform configurations, to regain determinism, and probabilistic timing analyses, to handle the remaining non-determinism., The research leading to these results has received funding from the Horizon Europe Programme under the SAFEXPLAIN Project (www.safexplain.eu), grant agreement num. 101069595. BSC authors have also been supported by the Spanish Ministry of Science and Innovation under grant PID2019- 107255GBC21/AEI/10.13039/501100011033., Peer Reviewed, "Article signat per 22 autors/es: Jaume Abella, Jon Perez, Cristofer Englund, Bahram Zonooz, Gabriele Giordana, Carlo Donzella, Francisco J. Cazorla, Enrico Mezzetti, Isabel Serra, Axel Brando, Irune Agirre, Fernando Eizaguirre, Thanh Hai Bui, Elahe Arani, Fahad Sarfraz, Ajay Balasubramaniam, Ahmed BadarIlaria Bloise, Lorenzo Feruglio, Ilaria Cinelli, Davide Brighenti, Davide Cunial"
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

BerryBees: Breadth first search by bit-tensor-cores

  • Niu, Yuyao
  • Casas, Marc|||0000-0003-4564-2093
Breadth First Search (BFS) plays a key role in computational science, networking, and artificial intelligence applications. Although the BFS approach has been extensively studied, particularly in its direction-optimized form, existing implementations still present three main issues: (1) high memory footprint; (2) the under-realized lightweight representations using bitmaps; and (3) the underuse of modern hardware such as Tensor Cores Units (TCUs). In this paper, we propose BerryBees, an efficient algebraic BFS algorithm that leverages the Matrix Multiply-Accumulate (MMA) instructions of TCUs. The novelty of BerryBees lies in (1) the Binarized Row Slice (BRS) format, which encodes the adjacency matrix by using bitmaps to represent non-empty row segments; and (2) a warp-level algorithm that leverages TCUs for accelerating both SpMV and SpMSpV operations for enhanced BFS performance. The experimental results on three latest NVIDIA GPUs show that BerryBees outperforms five state-of-the-art BFS methods: GAP, Gunrock, Enterprise, GSWITCH, and GraphBLAST, and delivers average speedups of 1.42 ×, 1.97×, 5.05×, 1.24×, and 3.74× (up to 9.99×, 13.66×, 114.07×, 13.97×, and 24.74×), respectively., This work has been partially supported by the European HiPEAC Network of Excellence, the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contracts PID2019-107255GB-C21 and PID2019-105660RBC22), and the Generalitat de Catalunya (contract 2021-SGR00864). Yuyao Niu is supported by Grant PRE2022-104335, funded by MICIU/AEI/10.13039/501100011033, and by the "ESF+" Grant CEX2021-001148-S-20-2, funded by MICIU/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Hardware acceleration for high-volume operations of CRYSTALS-Kyber and CRYSTALS-Dilithium

  • Carril Gil, Xavier|||0009-0008-8392-7579
  • Kardaris, Charalampos
  • Ribes González, Jordi
  • Farràs Ventura, Oriol
  • Hernández Luz, Carles
  • Kostalabros, Vatistas
  • González Jiménez, Joel Ulises
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Many high-demand digital services need to perform several cryptographic operations, such as key exchange or security credentialing, in a concise amount of time. In turn, the security of some of these cryptographic schemes is threatened by advances in quantum computing, as quantum computer could break their security in the near future. Post-Quantum Cryptography (PQC) is an emerging field that studies cryptographic algorithms that resist such attacks. The National Institute of Standards and Technology (NIST) has selected the CRYSTALS-Kyber Key Encapsulation Mechanism and the CRYSTALSDilithium Digital Signature algorithm as primary PQC standards. In this paper, we present FPGA-based hardware accelerators for high-volume operations of both schemes. We apply High-Level Synthesis (HLS) for hardware optimization, leveraging a batch processing approach to maximize the memory throughput, and applying custom HLS logic to specific algorithmic components. Using reconfigurable field-programmable gate arrays (FPGAs), we show that our hardware accelerators achieve speedups between 3x and 9x over software baseline implementations, even over ones leveraging CPU vector architectures. Furthermore, the methods used in this study can also be extended to the new CRYSTALS-based NIST FIPS drafts, ML-KEM and ML-DSA, with similar acceleration results., This work was part of the project (ISOLDE), funded by MICIU/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR under Grant No. PCI2023-143372, and the European Union’s Horizon Europe Programme under project Chips Joint Undertaking (JU) under Grant No. 101112274. At the same time, 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 (contract PID2019-107255GB-C21), and by the Government of Catalonia (contract 2021-SGR-763). X. Carril has the support of the predoctoral programme AGAUR-FI grants (2024 FI-1 00520) Joan Oró from the Secretariat for Universities and Research of the Department of Research and Universities of the Generalitat de Catalunya and the European Social Fund Plus. J. Ribes-González and O. Farràs are supported by grant 2021-SGR-00115 from the Government of Catalonia, by the project HERMES, funded by INCIBE and by the European Union NextGeneration EU/PRTR, and the project ACITHEC PID2021-124928NB-I00, funded by MCIN/AEI/10.13039/501100011033. C. Hernandez was supported by “Ramón y Cajal” fellowship No. RYC2020-030685-I. V. Kostalabros was supported by the Agency for Management of University and Research Grants (AGAUR) of the Government of Catalonia under “Ajuts per a la contractació de personal investigador novell” fellowship No. 2019FI B01274., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Improving Timing-Related Guarantees for Main Memory in Multicore Critical Embedded Systems

  • Fernández de Lecea, Asier
  • Hassan, Mohamed
  • Mezzetti, Enrico|||0000-0002-1886-2931
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Cazorla Almeida, Francisco Javier
Main memory is one of the most complex resources to analyze in multicore-based embedded real-time systems, with contention in the memory controller and the timing constraints of the main memory device as the main contributors to that complexity. One of the main challenges in multicore real-time systems is producing the required evidence on the management of contention delay for the certification. This stems from the fact that current MPSoCs barely provide any event monitors on how tasks interact and delay each other in memory. Besides, even if hardware and software mechanisms are in place to mitigate contention in the memory system, it is hard - if at all possible - to provide evidence about their correctness. In this work, we cover this gap by proposing a lightweight hardware mechanism that tightly tracks inter-core contention in memory. The proposed hardware mechanism, which we evaluate in detail, improves the quality of timing-related evidence that must be provided on how contention in main memory of multicore real-time systems is handled in adherence to applicable safety standards., This work has been supported by Grant PID2019-107255GB-C21 funded by MCIN/AEI/ 10.13039/501100011033, the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No.772773), and the Natural Sciences and Engineering Research Council of Canada (NSERC). The authors also thank the support of the Department of Research and Universities of the Government of Catalonia to the Smart and Safe Autonomous Systems (SSAS) Research Group, (Code:2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

SafeDE: A low-cost hardware solution to enforce diverse redundancy in multicores

  • Bas Jalón, Francisco
  • Alcaide Portet, Sergi|||0000-0001-8561-7795
  • Cabo Pitarch, Guillem
  • Benedicte Illescas, Pedro|||0000-0003-1670-7783
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
Failure risk must be tiny in high-integrity systems, such as those in cars, satellites and aircraft. Hence, safety measures must be deployed to avoid a single fault leading to a failure. Redundancy has been often used to address this concern, but it has been proven insufficient if a single fault can cause the same error in all redundant elements, which defeats the purpose of redundancy for error detection. Hence, to avoid this scenario, diversity is implemented along with redundancy, being lockstep execution the most popular diverse redundancy solution for computing cores. However, classic lockstep solutions have non-negligible limitations if implemented in hardware (e.g., half of the cores can only be used for redundant execution and are not even visible at user level), or in software (e.g., the software loop to enforce staggering is long and costs performance). This paper tackles the limitations of classic lockstep solutions by providing an extended analysis and evaluation of SafeDE, a Diversity Enforcement hardware module combining the short loop to enforce diversity of hardware solutions, and the nonintrusiveness of software solutions. Hence, cores can operate in lockstep mode efficiently or run independent tasks. In this paper, we present SafeDE and its rationale, its application to N-modular systems, its hardware and software integration, and an evaluation showing its performance and area efficiency, and its behavior in the presence of faults., This work was supported in part by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 871467, and in part by the Spanish Ministry of Science and Innovation under Grant PID2019-107255GB-C21/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Adaptive power shifting for power-constrained heterogeneous systems

  • Ortega Carrasco, Cristobal
  • Alvarez Martí, Lluc
  • Buyuktosunoglu, Alper
  • Bertran Monfort, Ramon
  • Rosedahl, Todd Jon
  • Bose, Pradip
  • Moretó Planas, Miquel|||0000-0002-9848-8758
The number and heterogeneity of compute devices, even within a single compute node, has been steadily on the rise. Since all systems must operate under a power cap, the number of discrete devices that can run simultaneously at their highest frequency is limited by the globally-imposed power cap. Current systems incorporate a centralized power management unit that statically controls the distribution of power among the devices within the node. However, such static distribution policies are unaware of the dynamic utilization profile across the devices, which leads to unfair power allocations that end up degrading system throughput performance. The problem is particularly acute in the presence of heterogeneity since type-specific performance-boost capabilities cannot be leveraged via utilization-agnostic static power allocations. This paper proposes Adaptive Power Shifting for multi-accelerator heterogeneous systems (APS), a technique that leverages system utilization information to dynamically allocate and re-distribute power budgets across multiple discrete devices. Democratizing the power allocation based on dynamic needs results in dramatic speedup over a need-agnostic static allocation. We use APS in a real OpenPOWER compute node with 2 CPUs and 4 GPUs to demonstrate the value of on-demand, equitable power allocations. Overall, the proposed solution increases performance with respect to two state-of-the-art techniques by up to 14.9% and 13.8%., This work has been partially supported by the European Union’s Horizon 2020 research and innovation program under the Mont-Blanc 2020 project (grant agreement 779877), by the Spanish Ministry of Science and Innovation (contract PID2019-107255GB-C22), by Generalitat de Catalunya (contracts 2014-SGR-1051 and 2014-SGR-1272) and by the IBM/BSC Deep Learning Center initiative. Ll. Alvarez has been supported in part by the Spanish Ministry of Economy, Industry and Competitiveness under the Juan de la Cierva Formacion fellowship No. FJCI-2016- 30984. M. Moreto has been supported in part by the Spanish Ministry of Economy, Industry and Competitiveness under Ramon y Cajal fellowship No. RYC-2016-21104., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Human-in-the-loop online multi-agent approach to increase trustworthiness in ML models through trust scores and data augmentation

  • Bravo Rocca, Gusseppe Jesus|||0000-0001-6824-1124
  • Liu, Peini|||0000-0003-0058-8732
  • Guitart Fernández, Jordi|||0000-0003-0751-3100
  • Dholakia, Ajay
  • Ellison, David
  • Hodak, Miroslav
Increasing a ML model accuracy is not enough, we must also increase its trustworthiness. This is an important step for building resilient AI systems for safety-critical applications such as automotive, finance, and healthcare. For that purpose, we propose a multi-agent system that combines both machine and human agents. In this system, a checker agent calculates a trust score of each instance (which penalizes overconfidence in predictions) using an agreement-based method and ranks it; then an improver agent filters the anomalous instances based on a human rule-based procedure (which is considered safe), gets the human labels, applies geometric data augmentation, and retrains with the augmented data using transfer learning. We evaluate the system on corrupted versions of the MNIST and FashionMNIST datasets. We get an improvement in accuracy and trust score with just few additional labels compared to a baseline approach., This work was supported by Lenovo as part of LenovoBSC 2020 collaboration agreement, by the Spanish Government under contracts PID2019-107255GB-C21 and PID2019-107255GB-C22, and by the Generalitat de Catalunya under contract 2017-SGR-1414 and under grant 2020 FI-B 00257., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

A methodology for selective protection of matrix multiplications: A diagnostic coverage and performance trade-off for CNNs executed on GPUs

  • Fernández Muñoz, Javier
  • Agirre Troncoso, Irune
  • Pérez Cerrolaza, Jon
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Cazorla Almeida, Francisco Javier
The ability of CNNs to efficiently and accurately perform complex functions, such as object detection, has fostered their adoption in safety-related autonomous systems. These algorithms require high computational performance platforms that exploit high levels of parallelism. The detection, control and mitigation of random errors in these underlying high computational platforms become a must according to functional safety standards. In this paper, we propose protecting, with a catalog of diagnostic techniques, the most computationally expensive operation of the CNNs, the matrix multiplication. However, this protection entails a performance penalty, and the complete CNN protection may be unaffordable for those systems operating with strict real-time constraints. This paper proposes a three-stage methodology to selectively protect CNN layers to achieve the required diagnostic coverage and performance trade-off: i) sensitivity analysis to misclassification per CNN layers using a statistical fault injection campaign, ii) layer-by- layer performance impact and diagnostic coverage analysis, and iii) selective layer protection. Furthermore, we propose a strategy to effectively compute the achievable diagnostic coverage of large matrices implemented on GPUs. Finally, we apply the proposed methodology and strategy in Tiny YOLO-v3, an object detector based on CNNs., Ikerlan authors have received funding from Elkartek grant project KK-2021/00123 of the Basque government. BSC authors have been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GBC21/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

GMX: Instruction set extensions for fast, scalable, and efficient genome sequence alignment

  • Doblas Font, Max|||0000-0002-8909-3033
  • Lostes Cazorla, Óscar|||0000-0001-5166-3806
  • Aguado Puig, Quim|||0000-0003-4871-3192
  • Cebry, Nicholas
  • Fontova Muste, Pau
  • Batten, Christopher
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Sequence alignment remains a fundamental problem in computer science with practical applications ranging from pattern matching to computational biology. The ever-increasing volumes of genomic data produced by modern DNA sequencers motivate improved software and hardware sequence alignment accelerators that scale with longer sequence lengths and high error rates without losing accuracy. Furthermore, the wide variety of use cases requiring sequence alignment demands flexible and efficient solutions that can match or even outperform expensive application-specific accelerators. To address these challenges, we propose GMX, a set of ISA extensions that enable efficient sequence alignment computations based on dynamic programming (DP). GMX extensions provide the basic building-block operations to perform fast tile-wise computations of the DP matrix, reducing the memory footprint and allowing easy integration into widely-used algorithms and tools. Furthermore, we provide an efficient hardware implementation that integrates GMX extensions in a RISC-V-based edge system-on-chip (SoC). Compared to widely-used software implementations, our hardware-software co-design leveraging GMX extensions obtains speed-ups from 25–265 ×, scaling to megabyte-long sequences. Compared to domain-specific accelerators (DSA), we demonstrate that GMX-accelerated implementations demand significantly less memory bandwidth, requiring less area per processing element (PE). As a result, a single GMX-enabled core achieves a throughput per area between 0.35-0.52 × that of state-of-the-art DSAs while being more flexible and reusing the core’s resources. Post-place-and-route results for a GMX-enhanced SoC in 22nm technology shows that GMX extensions only account for 1.7% of the overall area while consuming just 8.47mW. We conclude that GMX extensions represent versatile and scalable ISA additions to improve the performance of genome analysis tools and other use cases that require fast and efficient sequence alignment., This work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and Innovation [PID2019-107255GB-C21, TED2021-132634A-I00, and PID2020-113614RB-C21], by the Generalitat de Catalunya [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, by Lenovo-BSC Contract-Framework Contract (2022), by National Science Foundation (NSF) within the PPoSS Award #2118709, and by the eProcessor project which received funding from the European HighPerformance Computing Joint Undertaking (JU) under grant agreement No 956702. The JU receives support from the European Union’s Horizon 2020 research and innovation programme and the respective national research organisations from Spain (PCI2021-121991/ MCIN/AEI/10.13039/501100011033), Sweden, Greece, Italy, France, and Germany. The eProcessor project is also co-funded by the UE NextGenerationEU/PRTR. M. Doblas has been supported through an FPU fellowship [FPU20/04076]; Q. Aguado-Puig has been supported by PRE2021-101059 (founded by MCIN/AEI/10.13039/50110 0011033 and FSE+)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Efficient direct convolution using long SIMD instructions

  • Limas Santana, Alexandre de
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
  • Casas, Marc|||0000-0003-4564-2093
This paper demonstrates that state-of-the-art proposals to compute convolutions on architectures with CPUs supporting SIMD instructions deliver poor performance for long SIMD lengths due to frequent cache conflict misses. We first discuss how to adapt the state-of-the-art SIMD direct convolution to architectures using long SIMD instructions and analyze the implications of increasing the SIMD length on the algorithm formulation. Next, we propose two new algorithmic approaches: the Bounded Direct Convolution (BDC), which adapts the amount of computation exposed to mitigate cache misses, and the Multi-Block Direct Convolution (MBDC), which redefines the activation memory layout to improve the memory access pattern. We evaluate BDC, MBDC, the state-of-the-art technique, and a proprietary library on an architecture featuring CPUs with 16,384-bit SIMD registers using ResNet convolutions. Our results show that BDC and MBDC achieve respective speed-ups of 1.44× and 1.28× compared to the state-of-the-art technique for ResNet-101, and 1.83× and 1.63× compared to the proprietary library., This work receives EuroHPC-JU funding under grant no. 101034126, with support from the Horizon2020 program. Adrià Armejach is a Serra Hunter Fellow and has been partially supported by the Grant IJCI-2017-33945 funded by MCIN/AEI/10.13039/501100011033. Marc Casas has been par-tially supported by the Grant RYC-2017-23269 funded by MCIN/AEI/10.13039/501100011033 and ESF Investing in your future. This work is supported by the Spanish Ministry of Science and Technology through the PID2019-107255GB project and the Generalitat de Catalunya (contract 2017-SGR-1414)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Adaptable register file organization for vector processors

  • Ramírez Lazo, Cristóbal
  • Reggiani, Enrico
  • Rojas Morales, Carlos|||0000-0002-7714-0277
  • Figueras Bagué, Roger
  • Villa Vargas, Luis Alfonso
  • Ramírez Salinas, Marco Antonio
  • Valero Cortés, Mateo|||0000-0003-2917-2482
  • Unsal, Osman Sabri
  • Cristal Kestelman, Adrián|||0000-0003-1277-9296
Contemporary Vector Processors (VPs) are de-signed either for short vector lengths, e.g., Fujitsu A64FX with 512-bit ARM SVE vector support, or long vectors, e.g., NEC Aurora Tsubasa with 16Kbits Maximum Vector Length (MVL1). Unfortunately, both approaches have drawbacks. On the one hand, short vector length VP designs struggle to provide high efficiency for applications featuring long vectors with high Data Level Parallelism (DLP). On the other hand, long vector VP designs waste resources and underutilize the Vector Register File (VRF) when executing low DLP applications with short vector lengths. Therefore, those long vector VP implementations are limited to a specialized subset of applications, where relatively high DLP must be present to achieve excellent performance with high efficiency. Modern scientific applications are getting more diverse, and the vector lengths in those applications vary widely. To overcome these limitations, we propose an Adaptable Vector Architecture (AVA) that leads to having the best of both worlds. AVA is designed for short vectors (MVL=16 elements) and is thus area and energy-efficient. However, AVA has the functionality to reconfigure the MVL, thereby allowing to exploit the benefits of having a longer vector of up to 128 elements microarchitecture when abundant DLP is present. We model AVA on the gem5 simulator and evaluate AVA performance with six applications taken from the RiVEC Benchmark Suite. To obtain area and power consumption metrics, we model AVA on McPAT for 22nm technology. Our results show that by reconfiguring our small VRF (8KB) plus our novel issue queue scheme, AVA yields a 2X speedup over the default configuration for short vectors. Additionally, AVA shows competitive performance when compared to a long vector VP, while saving 50% of area., Research reported in this publication is partially supported by CONACyT Mexico under Grant No. 472106, the Spanish State Research Agency - Ministry of Science and Innovation (contract PID2019-107255GB), and the European Union Regional Development Fund within the framework of the ERDF Operational Program of Catalonia 2014-2020 with a grant of 50% of the total cost eligible, under the DRAC project [001-P-001723]., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A Methodology for Selective Protection of Matrix Multiplications: A Diagnostic Coverage and Performance Trade-off for CNNs Executed on GPUs

  • Fernández, Javier
  • Agirre, Irune
  • Perez Cerrolaza, Jon
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Cazorla Almeida, Francisco Javier
The ability of CNNs to efficiently and accurately perform complex functions, such as object detection, has fostered their adoption in safety-related autonomous systems. These algorithms require high computational performance platforms that exploit high levels of parallelism. The detection, control and mitigation of random errors in these underlying high computational platforms become a must according to functional safety standards. In this paper, we propose protecting, with a catalog of diagnostic techniques, the most computationally expensive operation of the CNNs, the matrix multiplication. However, this protection entails a performance penalty, and the complete CNN protection may be unaffordable for those systems operating with strict real-time constraints. This paper proposes a three-stage methodology to selectively protect CNN layers to achieve the required diagnostic coverage and performance trade-off: i) sensitivity analysis to misclassification per CNN layers using a statistical fault injection campaign, ii) layer-by- layer performance impact and diagnostic coverage analysis, and iii) selective layer protection. Furthermore, we propose a strategy to effectively compute the achievable diagnostic coverage of large matrices implemented on GPUs. Finally, we apply the proposed methodology and strategy in Tiny YOLO-v3, an object detector based on CNNs., Ikerlan authors have received funding from Elkartek grant project KK-2021/00123 of the Basque government. BSC au- thors have been partially supported by the Spanish Ministry of Science and Innovation under grant PID2019-107255GB- C21/AEI/10.13039/501100011033
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Leveraging HLS to design a versatile & high-performance Classic McEliece accelerator

  • Kostalabros, Vatistas
  • Ribes González, Jordi
  • Carril Gil, Xavier|||0009-0008-8392-7579
  • Farràs Ventura, Oriol
  • Hernández Luz, Carles
  • Moretó Planas, Miquel|||0000-0002-9848-8758
By harnessing fundamental quantum properties, a large-scale quantum computer could undermine currently deployed public-key algorithms. The post-quantum, code-based cryptosystem Classic McEliece (CM) addresses this security concern. However, its large public key size (up to 1.3 MB) poses various hardware implementation challenges. In this article, we focus on the high memory bandwidth requirements of the CM encoding function, in the context of heterogeneous CPU-FPGA devices. More concretely, we target the acceleration of public-key loading and processing from any globally shared or accelerator-private memory system. We present a novel and constant-time accelerator eEnc that exploits the elevated parallelization potential of FPGA devices to yield high-performance results. Our accelerator implements the encoding and the random error vector generation functions, which comprise the main computational load of Encapsulation. Two accelerator design variants are introduced, providing different hardware tradeoffs. Regarding intra-accelerator data communication, and unlike other state-of-the-art (SOTA) works, we combine a streaming protocol with task-level parallelization to remove the need to store the public key in accelerator-private memories. Our proposed design shows new record execution times over its SOTA counterparts, ranging on average from 3.5× up to 7.7× across the five security level parameter sets. Our end-to-end implementation in a Zynq SoC shows an average speedup of 2.2× compared to a 64-bit vectorized CM software-baseline. The elevated logic resource consumption, characteristic of HLS designs, can be readily adjusted with a performance tradeoff., This work has been partially supported by the European HiPEAC Network of Excellence, by the Spanish Ministry of Scienceand Innovation MCIN/AEI 10.13039/501100011033 (contracts ACITHEC PID2021-124928NB-I00, PID2019-107255GB-C21and ”Ramón y Cajal” fellowship No. RYC2020-030685-I), by the Generalitat de Catalunya (contract 2021-SGR-00763, 2021-SGR-00115 and 2023-146511NB-I00), by the Agency for Management of University and Research Grants (AGAUR) of theGovernment of Catalonia under ”Ajuts per a la contractació de personal investigador novell” (fellowships No. 2019FI B01274and 2024 FI-1 00520), by the European Union within the framework of the ERDF of Catalonia 2014–2020 under the DRACproject [001-P-001723], and by the project HERMES funded by the European NextGenerationEU/PRTR via INCIBE., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Morrigan: A composite instruction TLB prefetcher

  • Vavouliotis, Georgios
  • Alvarez Martí, Lluc
  • Grot, Boris
  • Jiménez, Daniel A.
  • Casas, Marc|||0000-0003-4564-2093
The effort to reduce address translation overheads has typically targeted data accesses since they constitute the overwhelming portion of the second-level TLB (STLB) misses in desktop and HPC applications. The address translation cost of instruction accesses has been relatively neglected due to historically small instruction footprints. However, state-of-the-art datacenter and server applications feature massive instruction footprints owing to deep software stacks, resulting in high STLB miss rates for instruction accesses. This paper demonstrates that instruction address translation is a performance bottleneck in server workloads. In response, we propose Morrigan, a microarchitectural instruction STLB prefetcher whose design is based on new insights regarding instruction STLB misses. At the core of Morrigan there is an ensemble of table-based Markov prefetchers that build and store variable length Markov chains out of the instruction STLB miss stream. Morrigan further employs a sequential prefetcher and a scheme that exploits page table locality to maximize miss coverage. An important contribution of the work is showing that access frequency is more important than access recency when choosing replacement candidates. Based on this insight, Morrigan introduces a new replacement policy that identifies victims in the Markov prefetchers using a frequency stack while adapting to phase-change behavior. On a set of 45 industrial server workloads, Morrigan eliminates 69% of the memory references in demand page walks triggered by instruction STLB misses and improves geometric mean performance by 7.6%., This work is partially supported by the Spanish Ministry of Science and Technology through the PID2019-107255GB project, the Generalitat de Catalunya (contract 2017-SGR-1414), the NSF grant CCF-1912617, the Semiconductor Research Corporation grant 2936.001, and generous gifts from Intel Labs. Georgios Vavouliotis has been supported by the Spanish Ministry of Economy, Industry and Competitiveness and the European Social Fund under the FPI fellowship No. PRE2018-087046. Marc Casas has been supported by the Spanish Ministry of Economy, Industry and Competitiveness under the Ramon y Cajal fellowship No. RYC-2017-23269., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

OmpSs-2 and OpenACC interoperation

  • Korakitis, Orestis
  • Garcia de Gonzalo, Simon
  • Guidotti, Nicolas
  • Barreto, João
  • Monteiro, José
  • Peña, Antonio|||0000-0002-3575-4617
We propose an interoperation mechanism to enable novel composability across pragma-based programming models. We study and propose a clear separation of duties and implement our approach by augmenting the OmpSs-2 programming model, compiler and runtime system to support OmpSs-2 + OpenACC programming. To validate our proposal we port ZPIC, a kinetic plasma simulator, to leverage our hybrid OmpSs-2 + OpenACC implementation. We compare our approach against OpenACC versions of ZPIC on a multi-GPU HPC system. We show that our approach manages to provide automatic asynchronous and multi-GPU execution, removing significant burden from the application’s developer, while also being able to outperform manually programmed versions, thanks to a better utilization of the hardware., This work has been part of the EPEEC project. The EPEEC project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 801051. This paper was also partially funded by the Ministerio de Ciencia e Innovación Agencia Estatal de Investigación (PID2019-107255GB-C21/AEI/10.13039/501100011033). We gratefully acknowledge the support of NVIDIA AI Technology Center (NVAITC) Europe who provided us the remote access to NVIDIA DGX-1, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Quasi Isolation QoS Setups to Control MPSoC Contention in Integrated Software Architectures

  • Garcia Esteban, Sergio
  • Serrano Cases, Alejandro
  • Abella Ferrer, Jaume|||0000-0001-7951-4028
  • Mezzetti, Enrico|||0000-0002-1886-2931
  • Cazorla Almeida, Francisco Javier
The use of integrated architectures, such as integrated modular avionics (IMA) in avionics, IMA-SP in space, and AUTOSAR in automotive, running on Multi-Processor System-on-Chip (MPSoC) is on the rise. Timing isolation among the different software partitions or applications thereof in an integrated architecture is key to simplifying software integration and its timing validation by ensuring the performance of each partition has no or very limited impact on others despite they share MPSoC’s hardware resources. In this work, we contend that the increasing hardware support for Quality of Service (QoS) guarantees in modern MPSoCs can be leveraged via specific setups to provide strong, albeit not full, isolation among different software partitions. We introduce the concept of Quasi Isolation QoS (QIQoS) setups and instantiate it in the Xilinx Zynq UltraScale+. To that end, out of the millions of setups offered by the different QoS mechanisms, we identify specific QoS configurations that isolate the traffic of time-critical software partitions executing in the core cluster from that generated by contender partitions in the programmable logic. Our results show that the selected isolation setup results in performance variations of the partitions run in the computing cores that are below 6 percentage points, even under scenarios with extremely high traffic coming from the programmable logic., This work has been supported by Grant PID2019-107255GB-C21 funded by MCIN/AEI/ 10.13039/501100011033 and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 772773)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A Tensor Marshaling Unit for sparse tensor algebra on general-purpose processors

  • Siracusa, Marco
  • Soria Pardos, Víctor
  • Sgherzi, Francesco
  • Randall, Joshua
  • Joseph, Douglas J.
  • Moretó Planas, Miquel|||0000-0002-9848-8758
  • Armejach Sanosa, Adrià|||0000-0003-2869-668X
This paper proposes the Tensor Marshaling Unit (TMU), a near-core programmable dataflow engine for multicore architectures that accelerates tensor traversals and merging, the most critical op-erations of sparse tensor workloads running on today’s computing infrastructures. The TMU leverages a novel multi-lane design that enables parallel tensor loading and merging, which naturally pro-duces vector operands that are marshaled into the core for efficient SIMD computation. The TMU supports all the necessary primitives to be tensor-format and tensor-algebra complete. We evaluate the TMU on a simulated multicore system using a broad set of ten-sor algebra workloads, achieving 3.6×, 2.8×, and 4.9× speedups over memory-intensive, compute-intensive, and merge-intensive vectorized software implementations, respectively., This work has been partially supported by the Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 (contract PID2019-107255GB-C21), the Generalitat of Catalunya (contract 2021-SGR-00763), the Arm-BSC Center of Excellence, the European HiPEAC Network of Excellence, and the European Processor Initiative (EPI), which is part of the European Union’s Horizon 2020 research and innovation program under grant agreement No. 826647. M. Siracusa has been supported through an FI fellowship [2022FI_B 00969] and V. Soria-Pardos through an FPU fellowship [FPU20-02132]. A. Armejach is a Serra Hunter Fellow., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

GPU cache system for COMPSs: A task-based distributed computing framework

  • Tatu, Cristian Catalin
  • Conejero Bañón, Francisco Javier
  • Vázquez Novoa, Fernando
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
In this paper, we propose a novel GPU cache system for COMPSs, a task-based distributed computing framework that enables the execution of parallel applications on heterogeneous clusters. GPU COMPSs tasks can exploit the computational power of NVIDIA GPUs to process large data blocks. However, the current implementation of COMPSs requires each task to write its output data to disk and the subsequent tasks to read them from disk, which introduces significant overhead. To overcome this limitation, we design and implement a GPU cache system that allows tasks to store and retrieve data from the GPU memory, avoiding unnecessary disk operations and reducing data transfer time. We conducted extensive experiments on several benchmarks and demonstrated that our GPU cache system can achieve significant speedups compared to the baseline COMPSs implementation., This work has been partially funded by the Spanish Government (PID2019-107255GB) y MCIN/AEI /10.13039/501100011033 (CEX2021-001148S), and by the Departament de Recerca i Universitats de la Generalitat de Catalunya, research group MPiEDist (2021 SGR 00412), and by the European Commission through the program Horizon 2020 and the European High-Performance Computing Joint Undertaking (JU) with contract 955558, project eFlows4HPC and by the MCIN/AEI/10.13039/501100011033 y European Union NextGenerationEU/PRTR (PCI2021-121957)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Hunting for open clusters in Gaia EDR3: 628 new open clusters found with OCfinder

  • Castro Ginard, Alfred
  • Jordi Nebot, Carme
  • Luri Carrascoso, Xavier
  • Cantat Gaudin, Tristan
  • Carrasco Martínez, Josep Manel
  • Casamiquela Floriach, Laia
  • Anders, Friedrich
  • Balaguer Núñez, Lola
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
Context. The improvements in the precision of the published data in Gaia EDR3 with respect to Gaia DR2, particularly for parallaxes and proper motions, offer the opportunity to increase the number of known open clusters in the Milky Way by detecting farther and fainter objects that have thus far gone unnoticed. Aims. Our aim is to continue to complete the open cluster census in the Milky Way with the detection of new stellar groups in the Galactic disc. We use Gaia EDR3 up to magnitude G = 18 mag, increasing the magnitude limit and therefore the search volume explored in one unit with respect to our previous studies. Methods. We used the OCfinder method to search for new open clusters in Gaia EDR3 using a big data environment. As a first step, OCfinder identified stellar statistical overdensities in five-dimensional astrometric space (position, parallax, and proper motions) using the DBSCAN clustering algorithm. Then, these overdensities were classified into random statistical overdensities or real physical open clusters using a deep artificial neural network trained on well-characterised G, GBP – GRP colour-magnitude diagrams. Results. We report the discovery of 628 new open clusters within the Galactic disc, with most of them being located beyond 1 kpc from the Sun. From the estimation of ages, distances, and line-of-sight extinctions of these open clusters, we see that young clusters align following the Galactic spiral arms while older ones are dispersed in the Galactic disc. Furthermore, we find that most open clusters are located at low Galactic altitudes with the exception of a few groups older than 1 Gyr. Conclusions. We show the success of the OCfinder method leading to the discovery of a total of 1274 open clusters (joining the discoveries here with the previous ones based on Gaia DR2), which represents almost 50% of the known population. Our ability to perform big data searches on a large volume of the Galactic disc, together with the higher precision in Gaia EDR3, enable us to keep completing the census with the discovery of new open clusters., This work was (partially) funded by the Spanish MICIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” by the “European Union” through grant RTI2018-095076-B-C21, and the Institute of Cosmos Sciences University of Barcelona (ICCUB, Unidad de Excelencia ‘María de Maeztu’) through grant CEX2019-000918-M. A.C.G. acknowledges Spanish Ministry FPI fellowship n. BES-2016-078499. This work has been partially supported by the Spanish Government (PID2019-107255GB), by Generalitat de Catalunya (contract 2014-SGR-1051)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Exploring total ionizing dose radiation effects across generations of NVIDIA Jetson devices: a comparative analysis

  • Rodríguez Ferrández, Iván
  • Tali, Maris
  • Kosmidis, Leonidas
  • Costantino, Alessandra
  • Steenari, David
With the rise of autonomous systems, high performance commercial embedded systems have emerged as powerful and energy-efficient solutions, holding significant promise for small satellites and spacecraft, as well as for payload processing. However, the typical commercial devices are not inherently engineered for space operations, necessitating thorough evaluation. NVIDIA Jetson embedded multicore and GPU devices are among these promising systems. In this study, we assess the impact of radiation ageing, specifically through a Total Ionizing Dose (TID) campaign, on three models of the NVIDIA Jetson family: Jetson Orin NX, Jetson Orin Nano and Jetson Xavier NX. Through comprehensive evaluation, we aim to uncover insights into the resilience and suitability of these devices for space applications., This work was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments”. Moreover, it was partially supported by the European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622), by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC2020-045931-I (Spanish State Research Agency / http://dx.doi.org/10.13039/501100011033) and the HiPEAC Network of Excellence., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A two level neural approach combining off-chip prediction with adaptive prefetch filtering

  • Jamet, Alexandre Valentin
  • Vavouliotis, Georgios
  • Jiménez, Daniel A.
  • Álvarez Martí, Lluc|||0000-0003-0506-8867
  • Casas, Marc|||0000-0003-4564-2093
To alleviate the performance and energy overheads of contemporary applications with large data footprints, we propose the Two Level Perceptron (TLP) predictor, a neural mechanism that effectively combines predicting whether an access will be off-chip with adaptive prefetch filtering at the first-level data cache (L1D). TLP is composed of two connected microarchitectural perceptron predictors, named First Level Predictor (FLP) and Second Level Predictor (SLP). FLP performs accurate off-chip prediction by using several program features based on virtual addresses and a novel selective delay component. The novelty of SLP relies on leveraging off-chip prediction to drive L1D prefetch filtering by using physical addresses and the FLP prediction as features. TLP constitutes the first hardware proposal targeting both off-chip prediction and prefetch filtering using a multilevel perceptron hardware approach. TLP only requires 7KB of storage. To demonstrate the benefits of TLP we compare its performance with state-of-the-art approaches using off-chip prediction and prefetch filtering on a wide range of single-core and multi-core workloads. Our experiments show that TLP reduces the average DRAM transactions by 30.7% and 17.7%, as compared to a baseline using state-of-the-art cache prefetchers but no off-chip prediction mechanism, across the single-core and multi-core workloads, respectively, while recent work significantly increases DRAM transactions. As a result, TLP achieves geometric mean performance speedups of 6.2% and 11.8% across single-core and multi-core workloads, respectively. In addition, our evaluation demonstrates that TLP is effective independently of the L1D prefetching logic., 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 and PID2019-105660RBC22) and by the Generalitat de Catalunya (contract 2021-SGR00763). This work is supported by the National Science Foundation through grant CCF-1912617 and generous gifts from Intel. Marc Casas has been partially supported by the Grant RYC2017-23269 funded by MCIN/AEI/10.13039/501100011033 and by ESF Investing in your future. Els autors agraeixen el suport del Departament de Recerca i Universitats de la Generalitat de Catalunya al Grup de Recerca ”Performance understanding, analysis, and simulation/emulation of novel architectures” (Codi: 2021 SGR 00865)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

XeroZerox: Analysis and Optimization of GPU Memory Management for High-Integrity Autonomous Systems

  • Calderon, Alejandro J.
  • Kosmidis, Leonidas
  • Nicolás, Carlos F.
  • Cazorla Almeida, Francisco Javier
Autonomous systems require high-performance processing capabilities, which demand the use of powerful accelerators such as GPUs. However, the use of GPUs in critical systems presents several challenges, since GPU programming models rely on explicit dynamic memory management. Traditionally, dynamic memory allocation in such systems is restricted to certain controlled scenarios, which require programs to be rewritten so that all the required memory is allocated at the beginning of the program and released at its end. However, many GPU applications do not follow this approach. Moreover, when dynamic memory allocation is used, it is critical to compute the exact amount of memory that will be used as well as to minimize it, to guarantee that it fits in the physical system memory. In this paper we present XeroZerox, an open-source tool that automatically converts the traditional dynamic memory allocations of GPU applications into allocations served from a centralized and optimally sized memory pool, which is managed in a way better suited for critical systems. XeroZerox allows legacy GPU applications to be used in a critical setup without rewriting them, minimizing at the same time their memory consumption and memory management runtime overhead., European Union’s Horizon Europe Program through the Modular Model-Based Design and Testing for Applications in Satellites (METASAT) (Grant Number: 101082622) Spanish Ministry of Economy and Competitiveness (Spanish State Research Agency/Agencia Española de Investigación (Grant Number: PID2019-107255GB-C21 and IJC-2020-045931-I) Department of Research and Universities of the Government of Catalonia with a Grant to the Computer Architecture and Operating Systems (CAOS) Research Group (Grant Number: 2021 SGR 00637), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of the multicore performance capabilities of the next generation flight computers

  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Wolf, Jannis
  • Rodríguez Ferrández, Iván
  • Jover Álvarez, Álvaro
  • Trompouki, Matina Maria
  • Kosmidis, Leonidas
  • Steenari, David
Multicore architectures are currently under adoption in the aerospace domain, however their software remains single-threaded. In this paper we argue about the benefits offered by homogeneous parallel processing, both in terms of performance, which is necessary for the implementation of advanced functionalities, as well as in terms of certification and in particular about mastering multicore interference.We discuss the implementation details of this programming paradigm in avionics and space real-time operating systems. We experimentally evaluate the performance benefits offered by several high-performance multicore platforms which are considered good candidates for next generation flight computers, using homogeneous parallel processing under a qualifiable real-time operating system used in the aerospace domain. Our results indicate near to linear speed-ups compared to traditional sequential processing, showing the benefits of this approach., This work was supported by the European Union’s Horizon Europe programme under the METASAT project (grant agreement 101082622). In addition, it was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments” and the GPU4S (GPU for Space) ESAfunded project. It was also partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Española de Investigación (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

OmpSs@cloudFPGA: An FPGA task-based programming model with message passing

  • De Haro Ruiz, Juan Miguel|||0000-0002-7427-9118
  • Cano, Rubén
  • Álvarez Martínez, Carlos|||0000-0003-0536-5183
  • Jiménez González, Daniel|||0000-0001-6064-7883
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
  • Labarta Mancho, Jesús José|||0000-0002-7489-4727
  • Abel, François
  • Ringlein, Burkhard
  • Weiss, Beat
Nowadays, a new parallel paradigm for energy-efficient heterogeneous hardware infrastructures is required to achieve better performance at a reasonable cost on high-performance computing applications. Under this new paradigm, some application parts are offloaded to specialized accelerators that run faster or are more energy-efficient than CPUs. Field-Programmable Gate Arrays (FPGA) are one of those types of accelerators that are becoming widely available in data centers. This paper proposes OmpSs@cloudFPGA, which includes novel extensions to parallel task-based programming models that enable easy and efficient programming of heterogeneous clusters with FPGAs. The programmer only needs to annotate, with OpenMP-like pragmas, the tasks of the application that should be accelerated in the cluster of FPGAs. Next, the proposed programming model framework automatically extracts parts annotated with High-Level Synthesis (HLS) pragmas and synthesizes them into hardware accelerator cores for FPGAs. Additionally, our extensions include and support two novel features: 1) FPGA-to-FPGA direct communication using a Message Passing Interface (MPI) similar Application Programming Interface (API) with one-to-one and collective communications to alleviate host communication channel bottleneck, and 2) creating and spawning work from inside the FPGAs to their own accelerator cores based on an MPI rank-like identification. These features break the classical host-accelerator model, where the host (typically the CPU) generates all the work and distributes it to each accelerator. We also present an evaluation of OmpSs@cloudFPGA for different parallel strategies of the N-Body application on the IBM cloudFPGA research platform. Results show that for cluster sizes up to 56 FPGAs, the performance scales linearly. To the best of our knowledge, this is the best performance obtained for N-body over FPGA platforms, reaching 344 Gpairs/s with 56 FPGAs. Finally, we compare the performance and power consumption of the proposed approach with the ones obtained by a classical execution on the MareNostrum 4 supercomputer, demonstrating that our FPGA approach reduces power consumption by an order of magnitude., This work has been done in the context of the IBM/BSC Deep Learning Center initiative. This work has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 754337 (EuroEXA), from Spanish Government (PID2019-107255GBC21/AEI/10.13039/501100011033), and from Generalitat de Catalunya (2017-SGR-1414 and 2017-SGR-1328)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

The METASAT hardware platform: A high-performance multicore, AI SIMD and GPU RISC-V platform for on-board processing

  • Kosmidis, Leonidas
  • Solé i Bonet, Marc|||0000-0002-9634-2026
  • Rodríguez Ferrández, Iván
  • Wolf, Jannis
  • Trompouki, Matina Maria
The METASAT Horizon Europe project which is funded by the European Commission and started in January 2023, will enable model-based design methodologies in order to manage the complexity of upcoming hardware and software for space on-board processing. As a representative high performance platform for on-board processing, METASAT will design a multi-core platform featuring accelerators prototyped on an FPGA. This includes both an AI SIMD accelerator tightly integrated with the CPU, as well as a GPU. All hardware components of the METASAT platform will be open source and based on the RISC-V open ISA. In this paper, we provide an overview of the platform architecture as well as preliminary implementation decisions, current development status and early results., This work was supported by the European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622). In addition, it was partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GBC21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Espanola de Investigacion (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

DDS: integrating data analytics transformations in task-based workflows [version 1, peer review: 1 approved, 2 approved with reservations]

  • Mammadli, Nihad
  • Ejarque Artigas, Jorge
  • Álvarez Cid-Fuentes, Javier
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
High-performance data analytics (HPDA) is a current trend in e-science research that aims to integrate traditional HPC with recent data analytic frameworks. Most of the work done in this field has focused on improving data analytic frameworks by implementing their engines on top of HPC technologies such as Message Passing Interface. However, there is a lack of integration from an application development perspective. HPC workflows have their own parallel programming models, while data analytic (DA) algorithms are mainly implemented using data transformations and executed with frameworks like Spark. Task-based programming models (TBPMs) are a very efficient approach for implementing HPC workflows. Data analytic transformations can also be decomposed as a set of tasks and implemented with a task-based programming model. In this paper, we present a methodology to develop HPDA applications on top of TBPMs that allow developers to combine HPC workflows and data analytic transformations seamlessly. A prototype of this approach has been implemented on top of the PyCOMPSs task- based programming model to validate two aspects: HPDA applications can be seamlessly developed and have better performance than Spark. We compare our results using different programs. Finally, we conclude with the idea of integrating DA into HPC applications and evaluation of our method against Spark., This research was financially supported by the European Union’s Horizon 2020 research and innovation programme under the grant agreement No 780622; and the Spanish Government (PID2019-107255GB), Generalitat de Catalunya (2014-SGR-1051)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

DRAM errors and cosmic rays: space invaders or science fiction?

  • Boixaderas Coderch, Isaac
  • Amaya, Jorge
  • Moré Codina, Sergi
  • Bartolomé Rodríguez, Javier
  • Vicente Dorca, David
  • Unsal, Osman Sabri
  • Gizopoulos, Dimitris
  • Carpenter, Paul Matthew
  • Radojkovic, Petar
  • Ayguadé Parra, Eduard|||0000-0002-5146-103X
It is widely accepted that cosmic rays are a plausible cause of DRAM errors in high-performance computing (HPC) systems, and various studies suggest that they could explain some aspects of the observed DRAM error behavior. However, this phenomenon is insufficiently studied in production environments. We analyze the correlations between cosmic rays and DRAM errors on two HPC clusters: a production supercomputer with server-class DDR3-1600 and a prototype with LPDDR3-1600 and no hardware error correction. Our error logs cover 2000 billion MB-hours for the MareNostrum 3 supercomputer and 135 million MB-hours for the Mont-Blanc prototype. Our analysis combines quantitative analysis, formal statistical methods and machine learning. We detect no indications that cosmic rays have any influence on the DRAM errors. To understand whether the findings are specific to systems under study, located at 100 meters above the sea level, the analysis should be repeated on other HPC clusters, especially the ones located on higher altitudes. Also, analysis can (and should) be applied to revisit and extend numerous previous studies which use cosmic rays as a hypothetical explanation for some aspects of the observed DRAM error behaviors., The research was supported by the Spanish Government through the contracts PID2019-107255GB-C21, PID2023-146511NB-I00 and CEX2021-001148-S, funded by MCIN/AEI/10.13039/501100011033. The work also received funding from the Department of Research and Universities of the Government of Catalonia (Code: 2021 SGR 00807, 2021 SGR 01007, 2021 SGR 01264). Paul Carpenter holds the Ramon y Cajal fellowship RYC2018-025628-I funded by MICIU/AEI/10.13039/501100011033 and ”ESF Investing in your future”. Support also came from the European Union’s Horizon Europe research and innovation programme under grant agreement No. 101097224 (REBECCA). Further financial assistance was provided by the Barcelona Zettascale Laboratory (reference REGAGE22e00058408992), which is financed by the Ministry for Digital Transformation and Public Services within the framework of the Resilience and Recovery Facility, and the European Union NextGenerationEU initiative. We acknowledge the NMDB database (www.nmdb.eu), founded under the European Union’s FP7 programme (contract no. 213007), for supplying part of the neutron monitor data., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Evaluating the computational capabilities of embedded multicore and GPU platforms for on-board image processing

  • Rodríguez Ferrández, Iván
  • Kosmidis, Leonidas
  • Trompouki, Matina Maria
  • Steenari, David
  • Cazorla Almeida, Francisco Javier
On-board Image Processing is one of the most computationally intensive tasks performed in space payload processing. With the constant increase in the resolution of optical sensors, new powerful architectures are needed for their processing. In this work, we evaluate the capabilities of several state-of-the-art embedded COTS and radiation tolerant multicore and GPU featuring platforms, with an open source on-board image processing application we have developed and parallelised. Our results show that both embedded multicores and especially GPUs are very effective for such tasks. In fact, GPUs become even more efficient when sensor sizes are increasing, making them ideal candidates for future space missions., This work was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments” and the GPU4S (GPU for Space) ESA-funded project. Moreover, it was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 772773) and European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622). In addition, it was partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GB-C21 and IJC-2020-045931-I (Spanish State Research Agency / Agencia Espanola de Investigacion (AEI) / http://dx.doi.org/10.13039/501100011033) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Block size estimation for data partitioning in HPC applications using machine learning techniques

  • Cantini, Riccardo
  • Marozzo, Fabrizio
  • Orsino, Alessio
  • Talia, Domenico
  • Trunfio, Paolo
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Ejarque Artigas, Jorge
  • Vázquez-Novoa, Fernando
The extensive use of HPC infrastructures and frameworks for running data-intensive applications has led to a growing interest in data partitioning techniques and strategies. In fact, application performance can be heavily affected by how data are partitioned, which in turn depends on the selected size for data blocks, i.e. the block size. Therefore, finding an effective partitioning, i.e. a suitable block size, is a key strategy to speed-up parallel data-intensive applications and increase scalability. This paper describes a methodology, namely BLEST-ML (BLock size ESTimation through Machine Learning), for block size estimation that relies on supervised machine learning techniques. The proposed methodology was evaluated by designing an implementation tailored to dislib, a distributed computing library highly focused on machine learning algorithms built on top of the PyCOMPSs framework. We assessed the effectiveness of the provided implementation through an extensive experimental evaluation considering different algorithms from dislib, datasets, and infrastructures, including the MareNostrum 4 supercomputer. The results we obtained show the ability of BLEST-ML to efficiently determine a suitable way to split a given dataset, thus providing a proof of its applicability to enable the efficient execution of data-parallel applications in high performance environments., This work has been partially supported by the European Commission through the Horizon 2020 Research and Innovation program and the EuroHPC JU under contract 955558 (eFlows4HPC project) and by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR (PCI2021‑121957 and CEX2021‑ 001148‑S) and by the Spanish Government (PID2019‑107255GB), and Generalitat de Catalunya (contract 2021‑SGR‑00412). We also acknowledge financial support from “National Centre for HPC, Big Data and Quantum Computing”, CN00000013 ‑ CUP H23C22000360005, and from “FAIR ‑ Future Artificial Intelligence Research” project ‑ CUP H23C22000860006., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

The BioExcel methodology for developing dynamic, scalable, reliable and portable computational biomolecular workflows

  • Ejarque Artigas, Jorge
  • Andrio Balado, Pau
  • Hospital Gasch, Adam
  • Conejero Bañón, Francisco Javier
  • Lezzi, Daniele|||0000-0001-5081-7244
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Gelpi Buchaca, Josep Lluís
Developing complex biomolecular workflows is not always straightforward. It requires tedious developments to enable the interoperability between the different biomolecular simulation and analysis tools. Moreover, the need to execute the pipelines on distributed systems increases the complexity of these developments. To address these issues, we propose a methodology to simplify the implementation of these workflows on HPC infrastructures. It combines a library, the BioExcel Building Blocks (BioBBs), that allows scientists to implement biomolecular pipelines as Python scripts, and the PyCOMPSs programming framework which allows to easily convert Python scripts into task-based parallel workflows executed in distributed computing systems such as HPC clusters, clouds, containerized platforms, etc. Using this methodology, we have implemented a set of computational molecular workflows and we have performed several experiments to validate its portability, scalability, reliability and malleability., This work has been supported by Spanish Ministry of Science and Innovation MCIN/AEI/10.13039/501100011033 under contract PID2019-107255GB-C21, by the Generalitat de Catalunya under contracts 2017-SGR-01414 and 2017-SGR1110, by the European Commission through the BioExcel Center of Excellence (Horizon 2020 Framework program) under contracts 823830, and 675728. This work is also partially supported by the CECH project which has been co-funded with 50% by the European Regional Development Fund under the framework of the ERFD Operative Programme for Catalunya 2014-2020, with a grant of 1.527.637,88€., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Case-study for integration of COTS SoC devices in reliable space systems for on-board processing

  • Rodríguez Ferrández, Iván
  • Steenari, David
  • Tali, Maris
  • Kosmidis, Leonidas
  • Tonicello, Ferdinando
Recent trends in Data Handling Systems (DHS) include increased data-rates, in-orbit reconfiguration and the introduction of advanced On-Board Processing (OBP) methods to extract actionable information on-board, with low latency. At the same time, NewSpace industry has successfully deployed COTS-based DHS and processing equipment in space. In particular for OBP, COTS-based processors and FPGAs can offer higher computational performances than space qualified equivalents – which in turn can enable new applications through more advanced OBP algorithms. The individual component cost is also lower for COTS than space qualified components, which can allow overall cost-optimisations on mission level.An internal working group at ESA has studied the concept of using "safety barriers" to ensure no propagation of failure from functions implemented with COTS to other on-board units. Thanks to ESA studies there is a path to use Class IV equipment on missions with higher class (Class I-III), through the use of hardware "safety barriers" to limit failure propagation from Commercial Off-The-Shelf (COTS) equipment.In our work, we take the above mentioned concepts and apply them to reference implementations, targeting payload processing modules based on standard form factors (ADHA) and automotive-grade GPU Systems-on-Chip (SoCs). In addition, we make use of previous work on improving in-flight availability of complex COTS SoC processors, through system and software Fault Detection, Isolation and Recovery (FDIR) techniques., This work was supported by ESA through the 4000136514/21/NL/GLC/my co-funded PhD activity ”Mixed Software/Hardware-based Fault-tolerance Techniques for Complex COTS System-on-Chip in Radiation Environments” and the GPU4S (GPU for Space) ESA-funded project. Moreover, it was supported by the European Community’s Horizon Europe programme under the METASAT project (grant agreement 101082622). In addition, it was partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GBC21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Espanola de Investigacion (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637). Leonidas Kosmidis was partially supported by the Spanish Ministry of Economy and Competitiveness under grant IJC2020-045931-I (Spanish State Research Agency / http://dx.doi.org/10.13039/501100011033)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Formal methods for high integrity GPU software development and verification

  • Aspetakis, Dimitrios
  • Trompouki, Matina Maria
  • Kosmidis, Leonidas
  • Ruiz, Jose
  • Marosy, Gabor
Modern safety critical systems require high levels of performance for advanced functionalities, which are not possible with the simple conventional architectures currently used in them. Embedded General Purpose Graphics Processing Units (GPG-PUs) are among the hardware technologies which can provide the high performance required in these domains. However, their massively parallel nature complicates the verification of their software and increases its cost because it usually involves code coverage through extensive human-driven testing. The Ada SPARK language has traditionally been used in highly-critical environments for its formal verification capabilities and powerful type system. The use of such tools which are backed up by theorem provers, has significantly lowered the amount of effort needed to validate functionality of safety-critical systems. In this European Space Agency (ESA) funded project, we utilize AdaCore's CUDA backend for Ada in conjunction with the SPARK language subset to assess the state of static verification for GPU kernels. We assess the error detection capabilities of the available tools and we formulate a methodology to maximise their effectiveness. Moreover, our project results using ESA's open source GPU4S Benchmarking suite show that common programming mistakes in GPU software development can be prevented., This work was funded by the European Space Agency (ESA) activity ”Formal Methods for GPU Software Development and Verification” (ESA STAR AO 2- 1856/22/NL/GLC/ov). The authors thank AdaCore for donation of a license and early access to Ada’s CUDA backend compiler along with their verification toolchain, as well as invaluable technical support. This work was also partially supported by the Spanish Ministry of Economy and Competitiveness under grants PID2019-107255GBC21 and IJC-2020-045931-I ( Spanish State Research Agency / Agencia Española de Investigación (AEI) / http://dx.doi.org/10.13039/501100011033 ) and by the Department of Research and Universities of the Government of Catalonia with a grant to the CAOS Research Group (Code: 2021 SGR 00637)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Parallel reduced-order modeling for digital twins using high-performance computing workflows

  • Ares de Parga Regalado, Sebastian|||0000-0001-5709-4683
  • Bravo Martínez, José Raúl|||0000-0002-4465-7536
  • Sibuet Ruiz, Nicolás|||0000-0003-2968-3653
  • Hernández Ortega, Joaquín Alberto|||0000-0001-9334-4002
  • Rossi, Riccardo|||0000-0003-0528-7074
  • Boschert, Stefan
  • Quintana Ortí, Enrique Salvador
  • Tomás Domínguez, Andrés Enrique
  • Tatu, Cristian Catalin
  • Vázquez Novoa, Fernando
  • Ejarque Artigas, Jorge
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
The integration of reduced-order models with high-performance computing is critical for developing digital twins, particularly for real-time monitoring and predictive maintenance of industrial systems. This paper presents a comprehensive, high-performance computing-enabled workflow for developing and deploying projection-based reduced-order models for large-scale mechanical simulations. We use PyCOMPSs’ parallel framework to efficiently execute reduced-order model training simulations, employing parallel singular value decomposition algorithms such as randomized singular value decomposition, Lanczos singular value decomposition, and full singular value decomposition based on tall-skinny QR. Moreover, we introduce a partitioned version of the hyperreduction scheme known as the Empirical Cubature Method to further enhance computational efficiency in projection-based reduced-order models for mechanical systems. Despite the widespread use of high-performance computing for projection-based reduced-order models, there is a significant lack of publications detailing comprehensive workflows for building and deploying end-to-end projection-based reduced-order models in high-performance computing environments. Our workflow is validated through a case study focusing on the thermal dynamics of a motor, a multiphysics problem involving convective heat transfer and mechanical components. The projection-based reduced-order model is designed to deliver a real-time prognosis tool that could enable rapid and safe motor restarts post-emergency shutdowns under different operating conditions, demonstrating its potential impact on the practice of simulations in engineering mechanics. To facilitate deployment, we use the High-Performance Computing Workflow as a Service strategy and Functional Mock-Up Units to ensure compatibility and ease of integration across high-performance computing, edge, and cloud environments. The outcomes illustrate the efficacy of combining projection-based reduced-order models and high-performance computing, establishing a precedent for scalable, real-time digital twin applications in computational mechanics across multiple industries., The authors acknowledge financial support from the Spanish Ministry of Economy and Competitiveness, through the “Severo Ochoa Programme for Centres of Excellence in R&D” (CEX2018-000797-S and CEX2021-001148-S)”, as well as to the project PID2019-107255GB (BSC authors). This project has received funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 955558. The JU receives support from the European Union’s Horizon 2020 research and innovation programme and Spain, Germany, France, Italy, Poland, Switzerland, Norway. This publication is part of the R&D project PCI2021-121944 and PCI2021-121957, financed by MCIN/AEI/10.13039/501100011033 and by the “European Union NextGenerationEU/PRTR”. Sebastian Ares de Parga Regalado acknowledges financial support from the Generalitat de Catalunya through the FI_SDUR-2021 grant (2021 FISDU 00142), which provided funding for his predoctoral training. BSC authors acknowledge financial support from the Departament de Recerca i Universitats de la Generalitat de Catalunya, research group MPiEDist (2021 SGR 00412). Author Fernando Vázquez is supported by PRE2022-104134 funded by MICIU/AEI /10.13039/501100011033 and by the FSE+., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Portability and scalability evaluation of large-scale statistical modeling and prediction software through HPC-ready containers

  • Abdulah, Sameh
  • Ejarque Artigas, Jorge
  • Marzouk, Omar
  • Ltaief, Hatem
  • Sun, Ying
  • Genton, Marc G.
  • Badia Sala, Rosa Maria|||0000-0003-2941-5499
  • Keyes, David E.
HPC-based applications often have complex workflows with many software dependencies that hinder their portability on contemporary HPC architectures. In addition, these applications often require extraordinary efforts to deploy and execute at performance potential on new HPC systems, while the users expert in these applications generally have less expertise in HPC and related technologies. This paper provides a dynamic solution that facilitates containerization for transferring HPC software onto diverse parallel systems. The study relies on the HPC Workflow as a Service (HPCWaaS) paradigm proposed by the EuroHPC eFlows4HPC project. It offers to deploy workflows through containers tailored for any of a number of specific HPC systems. Traditional container image creation tools rely on OS system packages compiled for generic architecture families (x86_64, amd64, ppc64, …) and specific MPI or GPU runtime library versions. The containerization solution proposed in this paper leverages HPC Builders such as Spack or Easybuild and multi-platform builders such as buildx to create a service for automating the creation of container images for the software specific to each hardware architecture, aiming to sustain the overall performance of the software. We assess the efficiency of our proposed solution for porting the geostatistics ExaGeoStat software on various parallel systems while preserving the computational performance. The results show that the performance of the generated images is comparable with the native execution of the software on the same architectures. On the distributed-memory system, the containerized version can scale up to 256 nodes without impacting performance., This work has been supported by King Abdullah University of Science and Technology (KAUST), Saudi Arabia, the Spanish Government (contract PID2019-107255GB), by the Generalitat de Catalunya (contract 2017-SGR-01414), and by the European Commission’s Horizon 2020 Framework program and the European High-Performance Computing Joint Undertaking (JU) under grant agreement No 955558 and by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU/PRTR (project eFlows4HPC)., Peer Reviewed