Skip to main content

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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+.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Open benchmarking for cell-based multiscale models: Lessons from a community initiative

  • Ntiniakou, Thaleia
  • Valencia, Alfonso
  • Montagud, Arnau
et al., The emergence of virtual human twins (VHT) in biomedical research has sparked interest in multiscale in silico modelling frameworks, particularly in their application bridging cellular to tissue levels. Among the diverse array of multiscale modelling tools, off-lattice center-based agent-based models (CBM) offer a promising approach due to their depiction of cells in 3D space, closely resembling biological reality. Despite the proliferation of CBM tools addressing various biomedical challenges, a comprehensive and systematic comparison among them has been elusive. This paper presents a community-driven benchmark initiative aimed at evaluating and comparing CBM for biomedical applications, akin to successful efforts in other scientific domains such as the Critical Assessment of Protein Structure Prediction (CASP). Enlisting developers from leading tools like BioDynaMo, Chaste, PhysiCell,TiSim, and CompuTiX, we devised a benchmark scope, defined metrics, and established reference datasets to ensure a meaningful and equitable evaluation. Unit tests targeting different solvers within these tools were designed, ranging from diffusion and mechanics to cell cycle simulations and growth scenarios. Results from these tests demonstrate varying tool implementations in handling diffusion, mechanics, and cell cycle equations, emphasising the need for standardised benchmarks and interoperability. Discussions among the community underscore the necessity for defining gold standards, fostering interoperability, and drawing lessons from analogous benchmarking experiences. The outcomes, disseminated through a public platform in collaboration with OpenEBench, aim to catalyse advancements in computational biology, offering a comprehensive resource for tool evaluation and guiding future developments in cell-level simulations. This initiative endeavours to strengthen and expand the computational biology simulation community through continued dissemination and performance-oriented benchmarking efforts to enable the use of VHT in biomedicine., European Commission, https://ror.org/00k4n6c32, PerMedCoE 951773, CREXDATA 101092749, EDITH-CSA 101083771, Hanami EUROHPC-JU-2022-INCO-04-01, ARTEMIS - UK BBSRC (Biotechnology and Biological Sciences Research Council), BB/V018930/1, BB/V01840X/1, BB/V018647/1 - Australian Research Council, DP230100380, FT230100352 - Generalitat Valenciana, CIDEXG/2023/22 - Ministerio de Ciencia e Innovación, https://ror.org/05r0vyz12, CEX2021-001148-S - BMBF (German federal ministry of Education and Research), LiSyM-Cancer, LiSyM-Cancer II., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001148-S)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

PhysiBoSS-Models: A database for multiscale models

  • Noël, Vincent
  • Ruscone, Marco
  • Heiland, Randy
  • Montagud, Arnau
  • Valencia, Alfonso
  • Barillot, Emmanuel
  • Macklin, Paul
  • Calzone, Laurence
[PT] PhysiBoSS é uma plataforma de código aberto que integra a modelagem baseada em agentes de populações celulares com redes Booleanas estocásticas intracelulares, permitindo simulações multiescalares de comportamentos biológicos complexos. Para promover o compartilhamento e o versionamento de modelos, apresentamos o banco de dados PhysiBoSS-Models: um repositório curado de modelos multiescalares construídos com o PhysiBoSS. Ao oferecer uma API Python simples, o PhysiBoSS-Models permite baixar e simular modelos preexistentes com facilidade por meio de ferramentas como o PhysiCell Studio. Ao fornecer acesso padronizado a modelos validados, o PhysiBoSS-Models facilita a reutilização, validação e comparação de desempenho, apoiando pesquisas em biologia., [EN] PhysiBoSS is an open-source platform that integrates agent-based modeling of cell populations with intracellular stochastic Boolean networks, enabling multiscale simulations of complex biological behaviors. To promote model sharing and versioning, we present the PhysiBoSS-Models database: a curated repository for multiscale models built with PhysiBoSS. By providing a simple Python API, PhysiBoSS-Models provides an easy way to download and simulate preexisting models through tools such as PhysiCell Studio. By providing standardized access to validated models, PhysiBoSS-Models facilitates reuse, validation, and benchmarking, supporting research in biology., This work has been supported by the French Plan Cancer-MIC ITMO, Project MoDICeD (No.20CM114-00) and by the French Agence Nationale pour la Recherche (ANR) under the France 2030 program, with the reference number ANR-24-EXCI-0004. AM acknowledges funding from the Generalitat Valenciana’s CIDE GenT programme under the project CIDEXG/2023/22. MR acknowledges funding from the Ayuda Severo Ochoa CEX2021-001148-S from MICIU/AEI., With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001148-S)., Peer reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

ALPI: Enhancing portability and interoperability of task-aware libraries

  • Sala Penadés, Kevin
  • Álvarez Robert, David
  • Peñacoba Veigas, Raúl
  • Arias Mallo, Rodrigo
  • Navarro Muñoz, Antoni
  • Roca Nonell, Aleix
  • Beltran Querol, Vicenç
Task-based programming models are a promising approach to exploiting complex distributed and heterogeneous systems. However, integrating different communication, offloading, and storage APIs within tasks poses performance and deadlock risks. Several Task-Aware libraries, such as TAMPI, TASIO, and TACUDA, have been developed to integrate blocking and non-blocking APIs within task-based programming models efficiently. In this paper, we introduce the Asynchronous Low-level Programming Interface (ALPI) to enable the interoperability and portability of Task-Aware libraries across various programming models and runtime systems. We have implemented ALPI in the Nanos6 and nOS-V runtimes, enhancing the integration of Task-Aware libraries with the OmpSs-2 and OpenMP programming models. This work is a step towards improving the composability of parallel programming models by supporting Task-Aware libraries across different runtime systems., This work was supported by the Spanish Ministry of Science and Innovation (grant PID2019-107255GB) and the Severo Ochoa Program (grant CEX2021-001148-S), both funded by MCIN/AEI/10.13039/501100011033. The Generalitat de Catalunya also supported this work via grant 2021-SGR-01007., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

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

  • Filgueras Izquierdo, Antonio
  • Agosta, Giovanni
  • Aldinucci, Marco
  • Álvarez Martínez, Carlos
  • D'Ambra, Pasqua
  • Biagioni, Andrea
  • De Haro Ruiz, Juan Miguel
  • Jiménez González, Daniel
  • Martorell Bofill, Xavier
  • Morais, Lucas Henrique
The TEXTAROSSA project aims to bridge the technology gaps that exascale computing systems are currently facing and will be key in the near future to overcome performance and energy efficiency challenges. This project provides solutions for improved energy efficiency by using state-of-the-art cooling and thermal control, seamless integration of heterogeneous accelerators in HPC multi-node platforms, and new arithmetic methods tailored to heterogeneous hardware platforms. Challenges are tackled 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 PCI2021121964 - TEXTAROSSA, and CEX2021-001148-S), the research project ST4HPC (PID2023-147979NB-C21) financed by MICIU/AEI /10.13039/501100011033 and by FEDER, EU, by Generalitat de Catalunya (2021 SGR 01007), and by the Barcelona Zettascale Laboratory, with the support of the Ministry for Digital Transformation and the Civil Service, within the framework of the Recovery, Transformation and Resilience Plan - Funded by the European Union - NextGenerationEU, 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 Filguerasa, b; Giovanni Agostac, l; Marco Aldinucci m,p; Carlos Álvarez a,b; Pasqua D’Ambra m; Massimo Bernaschi m; Andrea Biagioni d; Daniele Cattaneo c; Alessandro Celestini m, Massimo Celino f; Carlotta Chiarini d,n; Francesca Lo Cicero d; Paolo Cretaro d; William Fornaciari c,l; Ottorino Frezza d; Andrea Galimberti c; Francesco Giacomini o; Juan Miguel de Haro Ruiz a,b; Francesco Iannone f; Daniel Jaschke j,i,h; Daniel Jiménez-González a,b; Michał Kulczewski e: Alberto Leva c; Alessandro Lonardo d; Michele Martinelli d; Xavier Martorell a,b; Simone Montangero h,k,i,j; Lucas Morais a,b; Ariel Oleksiak e; Paolo Palazzari f; Luca Pontisso d; Federico Reghenzani c,l; Cristian Rossi d,n; Sergio Saponara g,l; Carlo Saverio Lodi c; Francesco Simula d; Federico Terraneo c,l; Piero Vicini d; Miquel Vidal b; Davide Zoni c; Giuseppe Zummo f / a Universitat Politècnica de Catalunya, Spain; b Barcelona Supercomputing Center, Spain; c DEIB – Politecnico di Milano, Italy; d INFN, Sezione di Roma, Italy; e Poznańskie Centrum Superkomputerowo-Sieciowe, Poland; f ENEA, C.R. Casaccia, Via Anguillarese 301, Rome, Italy; g University of Pisa, Italy; h Dipartimento di Fisica e Astronomia ‘‘G. Galilei’’, Università degli Studi di Padova, Italy; i INFN, Sezione di Padova, Italy; j Institute for Complex Quantum Systems, Ulm University, Germany; k Padua Quantum Technologies Research Center, Italy; l Centro Interuniversitario Nazionale per l’Informatica (CINI), Italy; m National Research Council (CNR), Italy; n Università "Sapienza" di Roma, Italy; o INFN, CNAF, Italy; p University of Torino, Italy, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Future climate-driven fires may boost ocean productivity in the iron-limited North Atlantic

  • Bergas Massó, Elisa
  • Hamilton, Douglas
  • Myriokefalitakis, Stelios
  • Rathod, Sagar
  • Gonçalves Ageitos, María
  • Pérez García-Pando, Carlos
Rapid shifts in fire regimes affect the carbon cycle by releasing carbon and nutrients such as iron (Fe), potentially enhancing marine productivity and carbon export. Here we use fire emission projections and Earth system models to examine how climate-driven changes in fire emissions may alter soluble Fe (SFe) deposition and productivity. By century’s end, climate change could increase Fe emissions from fires by 1.7–1.8 times beyond projections considering only direct human influences. Model projections show rising SFe deposition in Northern Hemisphere high latitudes under increasing socio-economic activity, potentially boosting the impact of SFe deposition on productivity in the Fe-limited North Atlantic by up to 20% annually (40% in summer), assuming stable macronutrient levels. However, declining macronutrient availability may shrink Fe-limited areas, where climate-driven fires could offset productivity losses by 7–8%. In the Southern Ocean, fossil fuel emissions primarily control SFe deposition, as reductions in anthropogenic fires counterbalance climate-driven increases., This study was funded by the European Research Council under the Horizon 2020 research and innovation programme through the ERC Consolidator Grant FRAGMENT (grant agreement no. 773051) (awarded to C.P.G.-P.), the AXA Research Fund through the AXA Chair on Sand and Dust Storms at BSC (awarded to C.P.G.-P.), the Spanish Ministerio de Economía y Competitividad through the BIOTA project no. PID2022-139362OB-I00 supported by MICIU/ AEI/10.13039/501100011033 and FEDER, UE (awarded to M.G.A.), the European Regional Development Fund under the European Union, ESA through the DOMOS project (ESA AO/1-10546/20/I-NB) and the Department of Research and Universities of the Government of Catalonia through the Atmospheric Composition Research Group (code 2021 SGR 01550). E.B.-M. additionally acknowledges support from the Spanish Ministry of Science and Innovation (MCIN/ AEI/10.13039/501100011033) through the ‘Centro de Excelencia Severo Ochoa’ Program (CEX2021-001148-S). D.S.H. acknowledges support from NASA (grant no. 80NSSC24K0446). S.M. was funded through the REINFORCE research project implemented in the framework of HFRI called ‘Basic Research Financing (Horizontal Support of All Sciences)’ under the National Recovery and Resilience Plan ‘Greece 2.0’ funded by the European Union—NextGenerationEU (HFRI Project No. 15155). We also acknowledge the resources obtained on the Marenostrum4 supercomputer at BSC, granted through the RES project nos AECT-2023-1-0008 and AECT-2023-3-0026, along with the technical support provided by BSC and the Computational Earth Sciences team of the BSC Earth Sciences Department. We acknowledge high-performance computing support from Cheyenne (https://doi.org/10.5065/D6RX99HX) provided by NCAR’s Computational and Information Systems Laboratory, sponsored by the National Science Foundation, under project ID UNCS0045., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Predicting the future of supercomputing

  • Atchley, Scott
  • Badia Sala, Rosa Maria
  • Fryman, Joshua
  • Wisniewski, Robert W.
  • Manne, Srilatha
  • Manninen, Pekka
  • De Supinski, Bronis
  • Matsuoka, Satoshi
  • Milojicic, Dejan
  • Shipman, Galen
  • Van Hensbergen, Eric
  • Kranzlmüller, Dieter
The need to solve high-complexity problems using large-scale tightly coupled computing (that is, supercomputing) continues to grow. In this article, we address the needs, challenges, and opportunities for supercomputing over the next decade., We would like to thank Cullen Bash, Paolo Faraboschi, and Samantika Sury for their advice and insights that substantially helped improve this article. This manuscript has been authored in part by Lawrence Livermore National Security, LLC under Contract DE-AC52-07NA2 7344 with the U.S. Department of Energy (DOE) (Grant LLNL-JRNL-2005193); it is based in part upon work supported by the DOE, National Nuclear Security Administration under Contract 89233218CNA000001; and it used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-00OR22725. LA-UR-25-23959 (approved for public release). Rosa M. Badia acknowledges funding from Projects CEX2021-001148-S, and PID2023-147979NB-C21 from the MCIN/AEI and MICIU/AEI/10.13039/501100011033 and by FEDER, UE, by the Departament de Recerca i Universitats de la Generalitat de Catalunya, research group MPiEDist (2021 SGR 00412). AMD, the AMD Arrow logo, AMD CDNA, AMD Instinct, AMD ROCm, AMD Infinity Cache, AMD Infinity Fabric, and combinations thereof are trademarks of Advanced Micro Devices, Inc. Other product names used in this publication are for identification purposes only and may be trademarks of their respective companies., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Model generation architecture for digital twins and deployment system

  • Vázquez Novoa, Fernando
  • Conejero Bañón, Francisco Javier
  • Badia Sala, Rosa Maria
A Digital Twin is a virtual copy or representation of a physical object. Given the same input, both should produce the same output. A bidirectional data exchange between both of them should keep the objects in the same state by automatically reflecting changes from one of the objects to the other. Despite the popularity of the topic, there is a lack of standardization and no widespread adoption of techniques or architectures, resulting in ad-hoc implementations for each use case. This paper proposes a methodology for the generation of digital twins based on the definition of their life cycle, with phases that include training, operation and retraining. To allow efficient management of resources, each phase of the Digital Twin is implemented as a PyCOMPSs workflow. The proposed methodologies and architectures aims to simplify and strengthen the design and development of digital twins. It also allows for the extension of existing ones, the replacement of their components with more advanced ones, and the support of their reuse. We also consider workflow deployment, which is often a difficult task requiring specialized personnel and time. This article focuses on presenting the training phase of a Digital Twin life-cycle and demonstrates its operation by applying it to two real-world use case scenarios in ongoing projects. The use of the proposal led to a simplification of the developed code, allowed a distribution of the computational work among the available resources in a user-agnostic manner and the digital models created faithfully represent the physical object. Additionally, the paper presents the design of the operating life-cycle phase of a Digital Twin., Author Fernando Vázquez is supported by PRE2022-104134 funded by MICIU/AEI /10.13039/501100011033 and by the FSE+. This work has been partially funded by the the projects PID2019- 107255GB, CEX2021-001148-S, and PID2023-147979NB-C21 from the MCIN/AEI and MICIU/AEI /10.13039/501100011033 and by FEDER, UE, 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 and by the MCIN/AEI/10.13039/501100011033 y European Union NextGenerationEU/PRTR (PCI2021-121957), project eFlows4HPC; as well as by the European Commission under program Horizon Action under contract 101056886 (CAELESTIS). This work has also received funding from the European High Performance Computing Joint Undertaking (JU) and Spain, Italy, Iceland, Germany, Norway, France, Finland and Croatia under grant agreement No 101093038., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Performance analysis of distributed GPU-accelerated task-based workflows

  • Nogueira Lobo de Carvalho, Marcos
  • Queralt Calafat, Anna
  • Romero Moral, Óscar
  • Simitsis, Alkis
  • Tatu, Cristian
  • Badia Sala, Rosa Maria
We present an empirical approach to identify the key factors affecting the execution performance of task-based workflows on a High Performance Computing (HPC) infrastructure composed of heterogeneous CPU-GPU clusters. Our results reveal that the execution performance in distributed GPU-accelerated task-based workflows highly depends on several interrelated factors regarding the task algorithm, dataset, resources, and system employed. In addition, our analysis identifies key correlations among these factors, presents novel observations, and offers guidelines toward designing an automated method to handle task-based workflows in modern, high-compute capacity, CPU-GPU engines., This work has been partially supported by DEDS (H2020-MSCAITN2020) with grant agreement No. 955895, the EU-HORIZON programme CREXDATA under GA.101092749, the EU-HORIZON programme FAIR-CORE4EOSC under GA.101057264, the EUHORIZON programme EXTREMEXP under GA.101093164, the Spanish Government projects PID2019-107255GB and PID2020117191RB-I00/AEI/10.13039/501100011033andMCIN/AEI/10.13039 /501100011033 (CEX2021-001148-S), and by the Departament de Recerca i Universitats de la Generalitat de Catalunya (2021 SGR 00412, MPiEDist)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A task-based data-flow methodology for programming heterogeneous systems with multiple accelerator APIs

  • Boné Ribó, Aleix
  • Aguirre López, Alejandro
  • Álvarez Robert, David
  • Martínez Ferrer, Pedro José
  • Beltran Querol, Vicenç
Heterogeneous nodes that combine multi-core CPUs with diverse accelerators are rapidly becoming the norm in both high-performance computing (HPC) and AI infrastructures. Exploiting these platforms, however, requires orchestrating several low-level accelerator APIs such as CUDA, SYCL, and Triton. In some occasions they can be combined with optimized vendor math libraries: e.g., cuBLAS and oneAPI. Each API or library introduces its own abstractions, execution semantics, and synchronization mechanisms. Combining them within a single application is therefore error-prone and labor-intensive. We propose reusing a task-based data-flow methodology together with Task-Aware APIs (TA-libs) to overcome these limitations and facilitate the seamless integration of multiple accelerator programming models, while still leveraging the best-in-class kernels offered by each API. Applications are expressed as a directed acyclic graph (DAG) of host tasks and device kernels managed by an OpenMP/OmpSs-2 runtime. We introduce Task-Aware SYCL (TASYCL) and leverage Task-Aware CUDA (TACUDA), which elevate individual accelerator invocations to first-class tasks. When multiple native runtimes coexist on the same multi-core CPU, they contend for threads, leading to oversubscription and performance variability. To address this, we unify their thread management under the nOS-V tasking and threading library, to which we contribute a new port of the PoCL (Portable OpenCL) runtime. The methodology is evaluated on a multi-core server and a GPU-accelerated node using two contrasting workloads: the GPT-2 pre-training phase, representative of modern AI pipelines, and the HPCCG conjugate-gradient benchmark, representative of traditional HPC. From a performance standpoint, monolithic-kernel and fork-join executions are comparable —in both execution time and memory footprint— to a coarse-grained task-based formulation on both GPU-accelerated and multi-core systems. On the latter, unifying all runtimes through nOS-V mitigates interference and delivers performance on par with using a single runtime in isolation. These results demonstrate that task-aware libraries, coupled with the nOS-V library, enable a single application to harness multiple accelerator programming models transparently and efficiently. The proposed methodology is immediately applicable to current heterogeneous nodes and is readily extensible to future systems that integrate even richer combinations of CPUs, GPUs, FPGAs, and AI accelerators., This work has received support from multiple funding sources. It is part of the ST4HPC project (PID2023-147979NB-C21), funded by MCIN/AEI/10.13039/501100011033 and by FEDER, UE. This work is also promoted by the Barcelona Zettascale Laboratory, backed by the Ministry for Digital Transformation and of Public Services, within the framework of the Recovery, Transformation, and Resilience Plan - funded by the European Union - NextGenerationEU. This work has received funding from the DARE SGA1 Project, from the European HighPerformance Computing Joint Undertaking (JU) under Grant Agreement No 101202459 and from PCI2024-161687-3 Project funded by MICIU/AEI/10.13039/501,100,011,033 and European’s Union NextGenerationEU/PRTR. Additional support was provided by a Ramón y Cajal fellowship (RYC2019-027592-I), funded by MCIN/AEI/10.13039/ 501,100,011,033 and ESF/10.13039/501100004895, and by the Severo Ochoa Centre of Excellence programme (CEX2021-001148-S), also funded by MCIN/AEI. Finally, the Programming Models research group at BSC-UPC received support from the Departament de Recerca i Universitats de la Generalitat de Catalunya under grants 2021 SGR 01007 and 2025 STEP 00523. 11, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication 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
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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Supporting OpenMP free-agents by leveraging nOS-V

  • Peñacoba Veigas, Raúl
  • Álvarez Robert, David
  • Arcila Larrea, Vincent A.
  • Navarro Muñoz, Antoni
  • Beltran Querol, Vicenç
The OpenMP 6.0 standard introduces the free-agents feature, which enables a more dynamic execution model to improve application malleability and resource utilization. With free-agents, idle threads within a parallel region can be dynamically reassigned to execute tasks from other parallel regions. However, integrating this feature into complex runtimes, such as LLVM’s libomp, presents significant challenges due to its departure from traditional threading models. This paper presents our implementation of free-agents within the LLVM libomp runtime, which significantly reduces the complexity of implementing free-agents by leveraging the nOS-V threading and tasking library. Moreover, nOS-V also provides support for Task-Aware (TA) libraries and the co-execution of applications. Our enhanced libomp runtime, ported on top of nOS-V (libompv), also leverages these features. With libompv, OpenMP tasks and threads from any parallel region can safely call TA libraries, and independent processes can be efficiently co-executed to improve resource utilization or mitigate load imbalance issues. Experimental results show that libompv with free-agents delivers better performance than the original libomp for load-imbalanced or co-executed applications, while introducing no additional overhead for workloads that do not benefit from these new features., This work was partially supported by the Generalitat de Catalunya (contract 2021-SGR-01007) and the Spanish Government through the Severo Ochoa Program (CEX2021-001148-S/MCIN/AEI/10.13039/501100011033), and it is part of the ST4HPC (PID2023-147979NB-C21) research project, funded by MICIU /AEI/10.13039 /501100011033 and by FEDER, UE. This paper is also cofinanced by the Barcelona Zettaescale Laboratory, promoted by the Ministry for Digital Transformation and the Civil Service, within the framework of the Recovery, Transformation and Resilience Plan - Funded by the European Union - NextGenerationEU., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Managing workflow malleability in urgent computing for earthquake alerts

  • Ejarque Artigas, Jorge
  • Monterrubio Velasco, Marisol
  • Bhihe, Cedric
  • Pienkowska, Marta
  • de la Puente, Josep
  • Badia Sala, Rosa Maria
When large earthquakes happen, first responders need fast and accurate information regarding their impact. UCIS4EQ is an urgent computing platform that estimates ground shaking based on high-performance parallel 3D simulations. In this work, we present the PyCOMPSs implementation of UCIS4EQ towards urgent high-performance computing with a particular focus on providing a malleability mechanism. This allows UCIS4EQ to scan for data updates during runtime and dynamically incorporate said data into its execution. This involves, in particular, leveraging several HPC jobs. The implementation has been validated with data from the Samos Izmir earthquake. The malleable version of the workflow can reduce the use of computational resources by 40% while reducing the variability of the results and keeping the same time-to-solution as a non-malleable run., 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’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, PCI2021-121957)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

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

  • Filgueras Izquierdo, Antonio
  • Agosta, Giovanni
  • Aldinucci, Marco
  • Álvarez Martínez, Carlos
  • D'Ambra, Pasqua
  • De Haro Ruiz, Juan Miguel
  • Jiménez González, Daniel
  • Martorell Bofill, Xavier
  • Morais, Lucas Henrique
  • Vidal, Miquel
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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

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

  • Perdomo Hourné, Elias Augusto
  • Kropotov, Alexander
  • Cano Ladino, Francelly Katherine
  • Ali Shah, Syed Zafar
  • Cervero García, Teresa
  • Martorell Bofill, Xavier
  • 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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

nOS-V: Co-executing HPC applications using system-wide task scheduling

  • Álvarez Robert, David
  • Sala Penadés, Kevin
  • Beltran Querol, Vicenç
Future Exascale systems will feature massive parallelism, many-core processors and heterogeneous architectures. In this scenario, it is increasingly difficult for HPC applications to fully and efficiently utilize the resources in system nodes. Moreover, the increased parallelism exacerbates the effects of existing inefficiencies in current applications. Research has shown that co-scheduling applications to share system nodes instead of executing each application exclusively can increase resource utilization and efficiency. Nevertheless, the current oversubscription and co-location techniques to share nodes have several drawbacks which limit their applicability and make them very application-dependent.This paper presents co-execution through system-wide scheduling. Co-execution is a novel fine-grained technique to execute multiple HPC applications simultaneously on the same node, outperforming current state-of-the-art approaches. We implement this technique in nOS-V, a lightweight tasking library that supports co-execution through system-wide task scheduling. Moreover, nOS-V can be easily integrated with existing programming models, requiring no changes to user applications. We showcase how co-execution with nOS-V significantly reduces schedule makespan for several applications on different scenarios, outperforming prior node-sharing techniques., This work was supported by the Spanish Ministry of Science and Innovation (grant PID2019-107255GB) and the Severo Ochoa Program (grant CEX2021-001148-S), both funded by MCIN/AEI/10.13039/501100011033. The Generalitat de Catalunya also supported this work via grant 2021-SGR-01007., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

BerryBees: Breadth first search by bit-tensor-cores

  • Niu, Yuyao
  • Casas, Marc
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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Distributed and heterogeneous tensor–vector contraction algorithms for high performance computing

  • Martínez Ferrer, Pedro José
  • Yzelman, Albert-Jan Nicholas
  • Beltran Querol, Vicenç
The tensor–vector contraction (TVC) is the most memory-bound operation of its class and a core component of the higher-order power method (HOPM). This paper brings distributed-memory parallelization to a native TVC algorithm for dense tensors that overall remains oblivious to contraction mode, tensor splitting, and tensor order. Similarly, we propose a novel distributed HOPM, namely dHOPM3, that can save up to one order of magnitude of streamed memory and is about twice as costly in terms of data movement as a distributed TVC operation (dTVC) when using task-based parallelization. The numerical experiments carried out in this work on three different architectures featuring multicore and accelerators confirm that the performances of dTVC and dHOPM3 remain relatively close to the peak system memory bandwidth (50%–80%, depending on the architecture) and on par with STREAM benchmark figures. On strong scalability scenarios, our native multicore implementations of these two algorithms can achieve similar and sometimes even greater performance figures than those based upon state-of-the-art CUDA batched kernels. Finally, we demonstrate that both computation and communication can benefit from mixed precision arithmetic also in cases where the hardware does not support low precision data types natively., This work was supported in part by MCIN/AEI/10.13039/50110 0011033 and ESF/10.13039/501100004895 [grant number RYC2019- 027592-I], and in part by the HPC Technology Innovation Lab, a Barcelona Supercomputing Center and Huawei research cooperation agreement (2020–2022). This work has also benefited financially from the Severo Ochoa Centre of Excellence accreditation [grant number CEX2021-001148-S] funded by MCIN/AEI. The Programming Models research group at BSC-UPC received financial support from Departament de Recerca i Universitats de la Generalitat de Catalunya [grant number 2021 SGR 01007]., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Reinforcement learning-based adaptive mitigation of uncorrected DRAM errors in the field

  • Boixaderas Coderch, Isaac
  • Moré Codina, Sergi
  • Bartolomé Rodríguez, Javier
  • Vicente Dorca, David
  • Radojkovic, Petar
  • Carpenter, Paul Matthew
  • Ayguadé Parra, Eduard
Scaling to larger systems, with current levels of reliability, requires cost-effective methods to mitigate hardware failures. One of the main causes of hardware failure is an uncorrected error in memory, which terminates the current job and wastes all computation since the last checkpoint. This paper presents the first adaptive method for triggering uncorrected error mitigation. It uses a prediction approach that considers the likelihood of an uncorrected error and its current potential cost. The method is based on reinforcement learning, and the only user-defined parameters are the mitigation cost and whether the job can be restarted from a mitigation point. We evaluate our method using classical machine learning metrics together with a cost-benefit analysis, which compares the cost of mitigation actions with the benefits from mitigating some of the errors. On two years of production logs from the MareNostrum supercomputer, our method reduces lost compute time by 54% compared with no mitigation and is just 6% below the optimal Oracle method. All source code is open source., The work was 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). Paul Carpenter holds the Ramon y Cajal fellowship RYC2018-025628-I funded by MICIU/AEI/10.13039/501100011033 and "ESF Investing in your future"., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Applying a task-based approach to distributed machine learning workflows

  • Vázquez Novoa, Fernando
  • Lezzi, Daniele
  • Lordan Gomis, Francesc
  • Baghdadi, Fatemeh
  • Cirillo, Davide
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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Enhancing the output of time series forecasting algorithms for cloud resource provisioning

  • Agulló López, Ferran
  • Gutiérrez Torre, Alberto
  • Torres Viñals, Jordi
  • Berral García, Josep Lluís
Forecasting the resource consumption of workloads is a frequent approach in the cloud provisioning field. Ideally, such predictions allow obtaining a more accurate scheduling and management of resources in a computing cluster. However, the current approaches fail to properly forecast the future consumption in areas where sudden increases of consumption are present, i.e., spikes. Even, commonly employed metrics lack the ability to properly evaluate sharp behaviours in the traces. This may generate resource starvation problems in the running workloads and decreases the Quality of Service (QoS) provided to external users. To address this issue, we propose two strategies that modify the outputs of forecasting algorithms without changing the algorithms’ internals. The new outputs considerably enhance the prediction of sudden increases, duplicating the F1 score metric in average for all tested algorithms. This improvement in the handling of spikes comes with an increased over-provision of resources. Nevertheless, the proposed strategies give the user an easy way to control this trade-off between predicting spikes and the amount of over-provision. The user can decide which is the right balance that better fits the requirements of its specific scenario. Furthermore, we propose a new evaluation methodology that better assesses the behaviour of forecasting algorithms in cloud traces, especially focused on the performance around increases of consumption, and we give insights on the reasons behind the predictions of the algorithms with the application of explainability techniques. The code repository of this work can be accessed through GitHub at this link https://github.com/FerranAgulloLopez/ResourceForecasting., This work has been supported by the EU’s Horizon research and innovation programme under grant agreements HORIZON GA.101092646 (CloudSkin), HORIZON MSCA GA.101086248 (CloudStars), and by the Spanish Ministry of Science (MICINN), the Research State Agency (AEI) and European Regional Development Funds (ERDF/FEDER) under grant agreements PID-2021-126248OB-I00, MCIN/AEI/10.13039/ 501100011033, UE (DALEST), Severo Ochoa Center of Excellence CEX-2021-001148-S-20-3 and the Generalitat de Catalunya (AGAUR), Spain 2021-SGR-00478 (CROMAI)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Mind the memory gap: unveiling GPU bottlenecks in large-batch LLM inference

  • Garcia Recasens, Pol
  • Agulló López, Ferran
  • Zhu, Yue
  • Wang, Changyang
  • Lee, Eun Kyung
  • Tardieu, Olivier
  • Torres Tomás, Juan José
  • Berral García, Josep Lluís
Large language models have been widely adopted across different tasks, but their auto-regressive generation nature often leads to inefficient resource utilization during inference. While batching is commonly used to increase throughput, per-formance gains plateau beyond a certain batch size, especially with smaller models, a phenomenon that existing literature typically explains as a shift to the compute-bound regime. In this paper, through an in-depth GPU-level analysis, we reveal that large-batch inference remains memory-bound, with most GPU compute capabilities underutilized due to DRAM bandwidth saturation as the primary bottleneck. To address this, we propose a Batching Configuration Advisor (BCA) that optimizes memory allocation, reducing GPU memory requirements with minimal impact on throughput. The freed memory and underutilized GPU compute capabilities can then be leveraged by concurrent workloads. Specifically, we use model replication to improve serving throughput and GPU utilization. Our findings challenge conventional assumptions about LLM inference, offering new in-sights and practical strategies for improving resource utilization, particularly for smaller language models., This work has been partially financed by grant agreement EU-HORIZON GA.101095717 and by the EU-HORIZON MSCA programme under grant agreement EU-HORIZON MSCA GA.101086248. Also, it has been partially financed by Generalitat de Catalunya (AGAUR) under grant agreement 2021-SGR-00478, by Severo Ochoa Center of Excellence CEX-2021-001148-S-20-3, and by the Spanish Ministry of Science (MICINN), the Research State Agency (AEI) and European Regional Development Funds (ERDF/FEDER) under grant agreement PID2021-126248OBI00, MCIN/AEI/10.13039/ 501100011033/ FEDER, UE., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication 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
  • 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, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Enhancing OmpSs-2 suspendable tasks by combining operating system and user-level threads with C++ coroutines

  • Cinca Roca, Arnau
  • Roca Nonell, Aleix
  • Sala Penadés, Kevin
  • Peñacoba Veigas, Raúl
  • Álvarez Robert, David
  • Beltran Querol, Vicenç
This paper explores three methods for implementing suspendable tasks within task-based programming models: OS threads (pthreads), User-Level Threads (ULTs), and C++ coroutines. We enhance the OmpSs-2 programming model, originally supporting suspendable tasks via pthreads, to also accommodate ULTs and C++ coroutines. This unified approach facilitates a comprehensive comparative analysis using various benchmarks that includes recursive fork-join and data-flow parallelization strategies. Additionally, we contrast these suspension methods with the Cilk and OpenMP task-based programming models, which, despite their efficiency, lack support for suspendable tasks. Key contributions of this study include the novel integration of C++20 coroutines into the OmpSs-2 programming model, which can be combined with pthreads or ULTs. Furthermore, we introduce a new Linux kernel syscall that accelerates pthread context switches by an order of magnitude, thus narrowing the performance gap between ULTs and pthreads in context-switch times from two to one order of magnitude. C++ Coroutines are the ideal solution for scenarios where many tasks are simultaneously in a suspended state, or the frequency of task suspension and resumption is high because they have the smallest memory footprint and minor contextswitch overhead. However, they are limited to C++ programs, do not support TLS, and only allow task suspension at top-level functions. Still, pthreads and ULTs can bring remarkable benefits where C++ Coroutines cannot. We conclude that combining the strengths of coroutines with pthreads or ULTs brings productivity and performance benefits for programming models., This work was partially supported by the Generalitat de Catalunya (contract 2021-SGR-01007) and the Spanish Government through the Severo Ochoa Program (CEX2021-001148-S/MCIN/AEI/10.13039/501100011033). It is also part of the research project PID2023-147979NB-C21, funded by MICIU/AEI (10.13039/501100011033) and co-financed by the European Regional Development Fund (FEDER, EU). Additionally, this work was developed in the context of the European PILOT project, which has received funding from the European High-Performance Computing Joint Undertaking (JU) under grant agreement No. 101034126, with support from the European Union's Horizon 2020 research and innovation program and Spain, Italy, Switzerland, Germany, France, Greece, Sweden, Croatia, and Turkey. This paper is also co-financed by the Barcelona Zettaescale Laboratory (reference REGAGE22e00058408992), promoted by the Ministry for Digital Transformation and the Civil Service, within the framework of the Recovery, Transformation and Resilience Plan - Funded by the European Union - NextGenerationEU., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Towards generalizable Federated Learning in medical imaging: a real-world case study on mammography data

  • Tzortzis, Ioannis N.
  • Gutiérrez Torre, Alberto
  • Sykiotis, Stavros
  • Agulló López, Ferran
  • Bakalos, Nikolaos
  • Doulamis, Anastasios
  • Doulamis, Nikolaos
  • Berral García, Josep Lluís
Federated Learning has been rapidly gaining in popularity in medical applications, due to the increased privacy offered, since medical data doesn't need to leave the hospitals' premises for AI model training. However, a direct translation of a classic experiment to a federated one is not always straightforward. In this work, we delve into the intricacies of federated learning for a breast cancer classification tool. We compare classic model training with a federated variant, and highlight the adaptations that need to be taken care of to ensure the equivalence between the two. Specifically, we introduce the Breast Area Detection tool as an essential component of the pre-processing pipeline to enhance the robustness of Federated Learning by offering data harmonization. On top of that, we present an end-to-end Federated Learning framework that is effective for real-world data and scenarios. Among the three real-world hospitals involved in the experimental procedure, the proposed framework significantly improves performance at the first hospital, providing consistent results similar to those achieved in the classic approach. Experimental results demonstrate that the interventions introduced improved model performance by approximately 35%, aligning federated learning and centralized model performance., This paper is funded by the EU funded projects SECURED “Scaling Up Secure Processing, Anonymization And Generation Of Health Data For EU Cross Border Collaborative Research And Innovation” with grant agreement no. 101095717 and INCISIVE “A multimodal AI-based toolbox and an interoperable health imaging repository for the empowerment of imaging analysis related to the diagnosis, prediction and follow-up of cancer” with grant agreement no. 952179. This paper has been partially financed by the Spanish Ministry of Science (MICINN), the Research State Agency (AEI) and European Regional Development Funds (ERDF/FEDER) under grant agreement PID2021-126248OB-I00, Severo Ochoa Center of Excellence CEX-2021-001148-S-20-3, 2021- SGR-00478, UE, also Generalitat de Catalunya (AGAUR) under grant agreement 2021-SGR-00478., Peer Reviewed, Postprint (published version)