Pasar al contenido principal

Resultados relacionados

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

RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Population based metaheuristics in Spark: Towards a general framework using PSO as a case study

  • Pardo, Xoán C.
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Over the years metaheuristics have been successfully applied to optimization problems in many real-world applications. The increasing complexity and scale of the problems addressed has posed new challenges to researchers in the field. The application of distributed metaheuristics is a common approach to speed up the time to solution or improve its quality by leveraging traditional parallel programming models on platforms like multicore processors or computer clusters. More recently, the emergence of Cloud Computing and new programming models and frameworks for Big Data has facilitated access to an unprecedented amount of computational resources, which led to a growing interest in optimization frameworks that support the development and execution of distributed metaheuristics taking advantage of this potential. In this paper, we present the current status of development of one such framework that aims to provide support for the application of distributed population-based metaheuristics to the global optimization of large-scale problems in Spark. The framework provides a reduced set of abstractions to represent the general structure of population-based metaheuristics as templates and strategies to particularize them into concrete metaheuristics, as well as other nice features like out of the box implementations of the most common distributed models, full configurability through a human-friendly format, and the possibility of rapid prototyping and testing metaheuristics in the Spark shell. To validate the approach, a template for Particle Swarm Optimization (PSO) was implemented as a proof of concept, which includes strategies for instantiating different variants of the algorithm, configurable topologies, and sequential and distributed execution models., This work was supported by MCIN/AEI/10.13039/501100011033 [grant numbers PID2019-104184RB-I00 , PID2022-136435NB-I00 and PID2020-117271RB-C22 (BIODYNAMICS) ], PID2022 also funded by “ ERDF A way of making Europe ”, EU. Also supported by Xunta de Galicia [grant number ED431C 2021/30 ]. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

BetaGPU: Harnessing GPU power for parallelized beta distribution functions

  • Fernández-Fraga, Alejandro
  • González-Domínguez, Jorge
  • Martín, María J.
Permanent link to code/repository used for this code version: https://github.com/ElsevierSoftwareX/SOFTX-D-24-00555. Link to developer documentation/manual: https://github.com/UDC-GAC/BetaGPU, [Abstract]: The efficient computation of Beta distribution functions, particularly the Probability Density Function (PDF) and Cumulative Distribution Function (CDF), is critical in various scientific fields, including bioinformatics and data analysis. This work presents BetaGPU, a high-performance software package written in C++ and CUDA that leverages the parallel processing capabilities of Graphics Processing Units (GPUs) to significantly accelerate these computations, with an OpenMP version for multiCPU systems, and integrated seamlessly with popular statistical programming languages R and Python. This open-source package provides an accessible, accurate, and scalable solution for researchers and practitioners. By offloading intensive calculations to the GPU, this software is significantly faster than traditional single-core CPU-based methods, facilitating faster data analysis and enabling real-time applications. The software’s high performance and ease of use make it an invaluable tool for users in bioinformatics and other data-intensive domains., This work was supported by grants TED2021-130599A-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ (TED2021 also funded by “NextGenerationEU”/PRTR and PID2022 by “ERDF A way of making Europe”, EU); grant TSI-100925-2023-1, funded by Ministry for Digital Transformation and Civil Service and Next-GenerationEU/RRF; and FPU predoctoral grant of Alejandro Fernández-Fraga ref. FPU21/03408, funded by the Ministry of Science, Innovation and Universities, Spain. We gratefully thank the Galician Supercomputing Center (CESGA) for the access granted to its supercomputing resources. Funding for open access charge: Universidade da Coruña/CISUG., Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Acceleration of Cancer Detection through the Calculation of Beta Distributions on GPUs

  • Fernández-Fraga, Alejandro
  • González-Domínguez, Jorge
  • Martín, María J.
[Abstract]: DNA methylation analysis has emerged as a powerful method for non-invasive cancer detection and diagnosis. However, the statistical approaches underpinning these analyses are computationally intensive, creating a significant bottleneck for large-scale studies and clinical applications. This work addresses this challenge by presenting a high-performance, GPU-accelerated implementation of a cancer detection tool. We introduce a structured optimization methodology that leverages BetaGPU, a specialized library designed to accelerate beta distribution functions using GPU computing, to dramatically reduce the computational cost of the core statistical operations. We demonstrate how BetaGPU can be effectively integrated into a real-world bioinformatics pipeline, and introduce several optimizations to the library to further enhance performance. Our work confirms that leveraging efficient third-party GPU libraries provides a viable path to significant acceleration of methylation-based cancer detection tools, paving the way for broader adoption of accelerator technologies in bioinformatics workflows. The complete implementation of our new GPU-accelerated tool, is publicly available at https://github.com/UDC-GAC/CancerLocatorGPU., This work was supported by grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and “ERDF A way of making Europe”, EU; grant TSI-100925-2023-1, funded by Ministry for Digital Transformation and Civil Service and Next-GenerationEU/RRF; FPU predoctoral grant of Alejandro Fernández-Fraga ref. FPU21/03408, funded by the Ministry of Science, Innovation and Universities, Spain ; and by Xunta de Galicia, Consolidation Program of Competitive Reference Groups, ref. ED431C 2025/33. We gratefully thank the Galician Supercomputing Center (CESGA) for the access granted to its supercomputing resources., Xunta de Galicia; ED431C 2025/33, https://github.com/UDC-GAC/CancerLocatorGPU
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Parallel ACO-VNS for the Solution of Binary Combinatorial Optimization Problems in Computational Systems Biology

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The source code is made public at https://gitlab.com/RobertoPradoRodriguez/bipcaco-vns., [Abstract]: In this work, a parallel hybrid framework that combines Ant Colony Optimization (ACO) with Variable Neighborhood Search (VNS) to enhance both exploration and intensification is proposed. The method integrates a multicolony architecture with a self-adaptive cooperation mechanism that dynamically regulates information exchange among colonies during runtime. This design aims to overcome the limitations of standalone ACO while maintaining scalability on high-performance computing platforms. The proposed approach is evaluated on a set of challenging large-scale binary optimization benchmarks derived from cell signaling network modeling. Experimental results show that the ACO–VNS hybrid consistently outperforms standalone ACO. The results demonstrate the effectiveness and general applicability of the proposed framework for complex binary combinatorial optimization problems., RPR, PGG and RDB acknowledge funding from grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and “ERDF A way of making Europe”, EU; and Xunta de Galicia through the Consolidation Program of Competitive Reference Groups, ref. ED431C 2025/33. JRB acknowledges financial support from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/ 10.13039/501100011033 and ERDF/EU. Authors acknowledge the Saez-Rodriguez’s Lab for providing the benchmarks used in this work, and the Galician Supercomputing Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2025/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Real-time Analysis of Indoor Sports Game Situations through Deep Learning-based Classification

  • Cabado, Bruno
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG Play by Play dataset (Cabado, Guijarro-Berdiñas, & Padrón, 2025) in Zenodo: https://doi.org/10.5281/zenodo.12607661., [Abstract]: Live indoor sports broadcasts require dynamic camera control in response to relevant game situations such as penalties or timeouts, a process that traditionally relies on human operators. This paper presents a solution for automatic real-time classification of game states in indoor invasion sports, with handball as the primary case study and basketball as a secondary validation scenario. Our approach utilizes raw video directly from cameras, enabling real-time analysis. The system continuously processes video frames, assigning each to one of seven classes: left/right attack, left/right counterattack, left/right penalty, and timeout. A synthetic representation of each frame is used to standardize the depiction of game dynamics. The proposed pipeline includes object detection with a fine-tuned You Only Look Once (YOLO) model to locate players, the ball, and referees; object tracking to compute velocity vectors; generation of a synthetic frame representing the current game state; and final classification using a custom Dense Convolutional Network (DenseNet). Using a dataset of 20 handball matches, the proposed system achieved a macro-averaged F1-score of 96.1%, with a per-image inference time below 4 ms, evaluated on 118,129 images from matches unseen during training. The same pipeline was subsequently applied to basketball using only two matches, achieving an F1-score of 92.5% on 12,390 images, thereby illustrating the transferability of the proposed approach to other indoor invasion sports. The full pipeline operates in 34.04 ms with GPU acceleration, processing over 25 frames per second., This work was supported by Grants PID2019-109238GB-C22 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU; and by Xunta de Galicia [ED431C 2022/44 ED431B 2025/21]. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054). The authors also thank Universidade da Coruña/CISUG for funding the open access charges., Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431B 2025/21, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; IN606D/2021/2612054
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Accelerating Scientific Model Optimization with a Pipelined FPGA-Based Differential Evolution Engine [Poster]

  • Castro, Manuel de
  • Osorio, Roberto
  • Torres, Yuri
  • Llanos, Diego R.
Poster presented at 2025 IEEE 33rd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 04-07 May 2025, Fayetteville, AR, USA. https://www.fccm.org/poster-list-2025/ No mesmo simposio presentáronse traballo e poster., This work was supported by Spanish MICIU and the ERDF Program of the EU, (NATASHA Project, Grant PID2022-142292NB-I00); by Junta de Castilla y León-FEDER Grants, (PROPHET-2 Project), Junta de Castilla y León, Spain under Grant VA226P20; by MCIN/AEI/10.13039/ 501100011033 through “European Union NextGenerationEU/PRTR,” (Grant TED2021–130367B–I00); and by MCIN/AEI/10.13039/501100011033 through the ERDF Program of the EU (Grant PID2022-136435NB-I00). Manuel de Castro was supported by Spanish MICIU through Ayudas para la Formación de Profesorado Universitario FPU 2022. This research was supported by grants from NVIDIA (A100). The authors would like to thank Sergio Alonso Pascual for his help developing the GPU software used., Junta de Castilla y León; VA226P20
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Clupiter: a Raspberry Pi mini-supercomputer for educational purposes

  • Rodríguez-Iglesias, Alonso
  • Martín, María J.
  • Touriño, Juan
© 2024 IEEE. This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., [Abstract]: The main objective of this work is to bring supercomputing and parallel processing closer to non-specialized audiences by building a Raspberry Pi cluster, called Clupiter, which emulates the operation of a supercomputer. It consists of eight Raspberry Pi devices interconnected to each other so that they can run jobs in parallel. To make it easier to show how it works, a web application has been developed. It allows launching parallel applications and accessing a monitoring system to see the resource usage when these applications are running. The NAS Parallel Benchmarks (NPB) are used as demonstration applications. From this web application a couple of educational videos can also be accessed. They deal, in a very informative way, with the concepts of supercomputing and parallel programming., Clupiter has been supported by grants EDC431C 2021/30 (Xunta de Galicia, Consolidation Program of Competitive Reference Groups) and PID2022-136435NB-I00, funded by MCIN/AEI/ 1 0.13039/501100011033 and by “ERDF A wayof making Europe”, EU., Xunta de Galicia; EDC431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Self-adaptive Cooperation Scheme in a Parallel ACO Algorithm for Binary Combinatorial Problems

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Cursos e Congresos, C-155, [Abstract] The ant colony optimization (ACO) is widely used for combinatorial optimization problems, although it can suffer from fast convergence to local minima. In order to provide a versatile implementation of ACO, we present a parallel multicolony strategy with an improved cooperation scheme for binary combinatorial problems. Our proposal is based on a self-adaptive method, which assigns appropriate run-time cooperation levels to each problem based on its size and available computational resources. We evaluate this proposal with problems with different levels of cooperation and number of processes. All these configurations combined show its flexibility as a versatile solver for this type of problems, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30, RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by ”ERDF. A way of making Europe”, EU; Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019–2022, ref. ED431G 2019/01; Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN /AEI / 10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

“Play by play”: A dataset of handball and basketball game situations in a standardized space

  • Cabado, Bruno
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
Data Availability: "Play by Play": a dataset of handball and basketball game situations in a standardized space (Original data) (Zenodo): https://doi.org/10.5281/zenodo.12698090, [Abstract]: This paper presents a synthetic dataset of labeled game situations in recordings of federated handball and basketball matches played in Galicia, Spain. The dataset consists of synthetic data generated from real video frames, including 308,805 labeled handball frames and 56,578 labeled basketball frames extracted from 2105 handball and 383 basketball 5-s video clips. Experts manually labeled the video clips based on the respective sports, while the individual frames were automatically labeled using computer vision and machine learning techniques. The dataset encompasses seven classes of game situations: left attack, left counterattack, left penalty, right attack, right counterattack, right penalty, and timeout. In basketball, the penalty class refers to the free throws attempted by players after they have been fouled by an opposing player. Each frame in the dataset is assigned to one of these classes, considering the game situation and specific context. Importantly, the dataset does not contain actual video frames; instead, it provides a synthetic, normalized representation of each frame in JSON format. This tabular data includes player, referee, and ball positions on a normalized field, player and referee velocities, and key regions on the court. Positions of players, referees, and the ball were automatically inferred in each frame by an object detector, followed by a tracking step to detect object positions across frames and compute the velocity vectors. Finally, the obtained coordinates underwent normalization through a perspective transformation, ensuring that the data remained unaffected by variations in camera configurations across different arenas and camera setups. We refer to this standardized coordinate space as the 'unified space'. The dataset holds significant potential for reuse in various domains related to sports analytics and machine learning research. It can serve as a valuable resource for researchers, coaches, and sports enthusiasts, contributing to improvements in player performance, game strategies, match retransmissions, and sports-related technologies., This work was supported by Grants PID2019-109238GB-C22 and PID2022-136435NB-I00, funded by MICINN/AEI/10.13039/501100011033, by Xunta de Galicia (Grants ED431C 2022/44, ED431C 2021/30, ED431F 2021/11) and by `ERDF A way of making Europe', EU. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054)., Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431F 2021/11, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; IN606D/2021/2612054
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs

  • Rodríguez-Iglesias, Alonso
  • Tongli, Santoshkumar T.
  • Tucker, Emily
  • Louis-Noël Pouchet
  • Rodríguez, Gabriel
  • Touriño, Juan
The latest version of the evaluated artifact is available under DOI: 10.5281/zenodo.15048005. It includes the necessary instructions, software, and scripts to reproduce the experiments in this paper. UZP is also available at https://github.com/UDC-GAC/uzp-sparse-format., [Abstract]: Sparse data structures are ubiquitous in modern computing, and numerous formats have been designed to represent them. These formats may exploit specific sparsity patterns, aiming to achieve higher performance for key numerical computations than more general-purpose formats such as CSR and COO. In this work we present UZP, a new sparse format based on polyhedral sets of integer points. UZP is a flexible format that subsumes CSR, COO, DIA, BCSR, etc., by raising them to a common mathematical abstraction: a union of integer polyhedra, each intersected with an affine lattice. We present a modular approach to building and optimizing UZP: it captures equivalence classes for the sparse structure, enabling the tuning of the representation for target-specific and application-specific performance considerations. UZP is built from any input sparse structure using integer coordinates, and is interoperable with existing software using CSR and COO data layout. We provide detailed performance evaluation of UZP on 200+ matrices from SuiteSparse, demonstrating how simple and mostly unoptimized generic executors for UZP can already achieve solid performance by exploiting Z-polyhedra structures., This work was supported in part by the U.S. National Science Foundation award #2009020; by grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU; and by the predoctoral grant of Alonso Rodríguez-Iglesias FPU2022/01651, funded by the Ministry of Science, Innovation and Universities. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-!nanced by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01).
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

PARamrfinder: detecting allele-specific DNA methylation on multicore clusters

  • Fernández-Fraga, Alejandro
  • González-Domínguez, Jorge
  • Martín, María J.
Financiado para publicación en acceso aberto: CRUE-CSIC, [Abstract]: The discovery of Allele-Specific Methylation (ASM) is an important research field in biology as it regulates genomic imprinting, which has been identified as the cause of some genetic diseases. Nevertheless, the high computational cost of the bioinformatic tools developed for this purpose prevents their application to large-scale datasets. Hence, much faster tools are required to further progress in this research field. In this work we present PARamrfinder, a parallel tool that applies a statistical model to identify ASM in data from high-throughput short-read bisulfite sequencing. It is based on the state-of-the-art sequential tool amrfinder, which is able to detect ASM at regional level from Bisulfite Sequencing (BS-Seq) experiments in the absence of Single Nucleotide Polymorphism information. PARamrfinder provides the same Allelically Methylated Regions as amrfinder but at significantly reduced runtime thanks to exploiting the compute capabilities of common multicore CPU clusters and MPI RMA operations to attain an efficient dynamic workload balance. As an example, our tool is up to 567 times faster for real data experiments on a cluster with 8 nodes, each one containing two 16-core processors. The source code of PARamrfinder, as well as a reference manual, is available at https://github.com/UDC-GAC/PARamrfinder., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 and PID2022-136435NB-I00 / AEI / 10.13039/501100011033), PID2022 also funded by “ERDF A way of making Europe”. It was also supported by the Ministry of Universities of Spain under grant FPU21/03408, and by Xunta de Galicia and FEDER funds (Centro de Investigación de Galicia accreditation 2019–2022 and Consolidation Program of Competitive Reference Groups, under Grants ED431G 2019/01 and ED431C 2021/30, respectively)., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Binary combinatorial optimization plays a crucial role in various scientific and engineering fields. While deterministic approaches have traditionally been used to solve these problems, stochastic methods, particularly metaheuristics, have gained popularity in recent years for efficiently handling large problem instances. Ant Colony Optimization (ACO) is among the most successful metaheuristics and is frequently employed in non-binary combinatorial problems due to its adaptability. Although for binary combinatorial problems ACO can suffer from issues such as rapid convergence to local minima, its eminently parallel structure means that it can be exploited to solve large and complex problems also in this field. In order to provide a versatile ACO implementation that achieves competitive results across a wide range of binary combinatorial optimization problems, we introduce a parallel multicolony strategy with an improved cooperation scheme to maintain search diversity. We evaluate our proposal (Binary Parallel Cooperative ACO, BiPCACO) using a comprehensive benchmark framework, showcasing its performance and, most importantly, its flexibility as a successful all-purpose solver for binary combinatorial problems., RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033, PID2022 also funded by ‘ERDF A way of making Europe’, EU; Xunta de Galicia and FEDER funds of the EU (Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercom- puting Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Automated Approach for Accurate CPU Power Modelling

  • Maseda, Tomé
  • Enes, Jonatan
  • Expósito, Roberto R.
  • Touriño, Juan
Presented at: 2024 IEEE International Conference on Cluster Computing (CLUSTER), Kobe, Japan, 24-27 September 2024, This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published paper is available online at: https://doi.org/10.1109/CLUSTER59578.2024.00016, [Abstract]: Power supply is a limiting factor when increasing the computing capacity of supercomputers. As a consequence, power consumption has become one of the biggest challenges in the field of High Performance Computing (HPC). In order to develop energy-efficient tools (e.g., frameworks, applications), it is essential to have an accurate power consumption modelling. Al-though previous works proposed a wide variety of approaches to model CPU power consumption, building models in an automated and adaptable way to changing scenarios and predicting power with high precision remains complex due to multiple factors (e.g., training and test workloads, model variables). In this paper, we present a set of tools to fully automate the process of modelling power consumption using CPU time series data. More specifically, our proposal includes two tools: (1) CPUPowerWatcher, which gathers CPU metrics during the execution of user-configurable workloads; and (2) CPUPowerSeer, which builds models to predict CPU power consumption (e.g., polynomial regression) from different CPU variables (e.g., usage, clock frequency) using time series data. Thus, multiple models can be created and evaluated easily, allowing the selection of an optimal model for a specific workload. The experiments conducted by combining these tools allow analysing the impact of novel factors on CPU power consumption, such as the type of CPU usage generated by different workloads or how the CPU cores are allocated to them. In addition, the accuracy of six regression models is compared when predicting CPU- and I/O-intensive workloads using two different core allocations., This work was supported by grant PID2022-13643SNB-100, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU. CITIC, as a centre accredited for excellence within the Galician University Sys-tem and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021–27 operational program (ref. ED431G 2023/01). This work was also funded by Xunta de Galicia through a predoctoral fellowship (ref. ED481A-2023-035)., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED481A-2023-035
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

From Raw Feeds to Curated Clips: A Modular AI Framework for Sports Highlight Production

  • Cabado, Bruno
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
[Abstract]: In the era of social media and instantaneous content consumption, the demand for quick post-event sports highlights has emerged, requiring systems to deliver compelling summaries in a minimal turnaround time. This paper introduces an AI-driven framework designed to streamline the creation of match recaps by leveraging real-time data acquisition and efficient post-processing. The system analyzes multi-modal inputs —including live game statistics, audio-visual feeds, and contextual cues— to automatically identify key moments (e.g., goals, pivotal plays) as they occur. By integrating lightweight neural models and rule-based prioritization, it generates timestamped clips immediately after the match concludes, significantly reducing manual editing effort. The solution not only supports human editors by providing pre-curated material but also enables fully automated highlight production for platforms requiring instant content delivery. Evaluations on soccer and basketball matches demonstrate the system’s ability to cut post-event processing time by 87.5% while maintaining 90% accuracy in event selection compared to manual curation. The work underscores the potential of hybrid AI systems to bridge real-time analytics with post-production workflows, offering scalability across sports and media formats. The generated highlights are already being published on a production platform (https://tiivii.gal), demonstrating real-world applicability., This work was supported by Grants PID2019-109238GB-C22 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU; and by Xunta de Galicia [ED431C 2018/34, ED431F 2021/11, ED431C 2022/44]. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054)., Xunta de Galicia; ED431C 2018/34, Xunta de Galicia; ED431F 2021/11, Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; IN606D/2021/2612054
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

CUDA acceleration of MI-based feature selection methods

  • Beceiro, Bieito
  • González-Domínguez, Jorge
  • Morán-Fernández, Laura
  • Bolón-Canedo, Verónica
  • Touriño, Juan
[Abstract]: Feature selection algorithms are necessary nowadays for machine learning as they are capable of removing irrelevant and redundant information to reduce the dimensionality of the data and improve the quality of subsequent analyses. The problem with current feature selection approaches is that they are computationally expensive when processing large datasets. This work presents parallel implementations for Nvidia GPUs of three highly-used feature selection methods based on the Mutual Information (MI) metric: mRMR, JMI and DISR. Publicly available code includes not only CUDA implementations of the general methods, but also an adaptation of them to work with low-precision fixed point in order to further increase their performance on GPUs. The experimental evaluation was carried out on two modern Nvidia GPUs (Turing T4 and Ampere A100) with highly satisfactory results, achieving speedups of up to 283x when compared to state-of-the-art C implementations., This work was supported by grants PID2019-104184RB-I00, PID- 2019-109238GB-C22, TED2021-130599A-I00 and PID2022-136435NB- I00, funded by MCIN/AEI/ 10.13039/501100011033 (TED2021 also funded by “NextGenerationEU”/PRTR and PID2022 by “ERDF A way of making Europe”, EU). Grant TSI-100925-2023-1, funded by Ministry for Digital Transformation and Civil Service. FPU predoctoral grant of Bieito Beceiro ref. FPU20/00997, funded by the Ministry of Sci- ence, Innovation and Universities. We gratefully thank the Galician Supercomputing Center (CESGA) for the access granted to its super- computing resources. Funding for open access charge: Universidade da Coruña/CISUG., Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Formal Verification of Source-to-Source Transformations for HLS

  • Pouchet, Louis-Noël
  • Tucker, Emily
  • Zhang, Niansong
  • Chen, Hongzheng
  • Pal, Debjit
  • Rodríguez, Gabriel
  • Zhang, Zhiru
Presented at: 2024 ACM/SIGDA International Symposium on Field Programmable Gate Arrays (FPGA '24), [Abstract]: High-level synthesis (HLS) can greatly facilitate the description of complex hardware implementations, by raising the level of abstraction up to a classical imperative language such as C/C++, usually augmented with vendor-specific pragmas and APIs. Despite productivity improvements, attaining high performance for the final design remains a challenge, and higher-level tools like source-to-source compilers have been developed to generate programs targeting HLS toolchains. These tools may generate highly complex HLS-ready C/C++ code, reducing the programming effort and enabling critical optimizations. However, whether these HLS-friendly programs are produced by a human or a tool, validating their correctness or exposing bugs otherwise remains a fundamental challenge. In this work we target the problem of efficiently checking the semantics equivalence between two programs written in C/C++ as a means to ensuring the correctness of the description provided to the HLS toolchain, by proving an optimized code version fully preserves the semantics of the unoptimized one. We introduce a novel formal verification approach that combines concrete and abstract interpretation with a hybrid symbolic analysis. Notably, our approach is mostly agnostic to how control-flow, data storage, and dataflow are implemented in the two programs. It can prove equivalence under complex bufferization and loop/syntax transformations, for a rich class of programs with statically interpretable control-flow. We present our techniques and their complete end-to-end implementation, demonstrating how our system can verify the correctness of highly complex programs generated by source-to-source compilers for HLS, and detect bugs that may elude co-simulation., This work was supported in part by an Intel ISRA award; U.S. NSF awards #1750399 and #2019306; ACE, one of seven centers in JUMP 2.0, an SRC program sponsored by DARPA; and Grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", EU. We are particularly thankful to Jin Yang, Jeremy Casas, and Zhenkun Yang from Intel for their support and guidance on the ISRA project. We also thank Lana Josipovi and the anonymous reviewers for their feedback on earlier versions of this manuscript., United States. National Science Foundation; 1750399, United States. National Science Foundation; 2019306
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores

  • Castro, Roberto L.
  • Ivanov, Andrei
  • Andrade, Diego
  • Ben-Nun, Tal
  • Fraguela, Basilio B.
  • Hoefler, Torsten
© 2023 Autores | ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in International Conference for High Performance Computing, Networking, Storage and Analysis, https://doi.org/10.1145/3581784.3607087, [Abstract]: The increasing success and scaling of Deep Learning models demands higher computational efficiency and power. Sparsification can lead to both smaller models as well as higher compute efficiency, and accelerated hardware is becoming available. However, exploiting it efficiently requires kernel implementations, pruning algorithms, and storage formats, to utilize hardware support of specialized sparse vector units. An example of those are the NVIDIA's Sparse Tensor Cores (SPTCs), which promise a 2× speedup. However, SPTCs only support the 2:4 format, limiting achievable sparsity ratios to 50%. We present the V:N:M format, which enables the execution of arbitrary N:M ratios on SPTCs. To efficiently exploit the resulting format, we propose Spatha, a high-performance sparse-library for DL routines. We show that Spatha achieves up to 37× speedup over cuBLAS. We also demonstrate a second-order pruning technique that enables sparsification to high sparsity ratios with V:N:M and little to no loss in accuracy in modern transformers., This research was supported by the Ministry of Science and Innovation of Spain (grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU), the Ministry of Education (predoctoral grant of Roberto L. Castro, FPU19/03974), by Xunta de Galicia under the Consolidation Program of Competitive Reference Groups (ED431C 2021/30), and ERC grant PSAP, no. 101002047. We also acknowledge the support from CITIC, funded by Xunta de Galicia and FEDER funds of the EU (Centro de Investigación de Galicia accreditation 2019-2022, ED431G 2019/01). Finally, we thank the Swiss National Supercomputing Center (CSCS) and the Centro de Supercomputación de Galicia (CESGA) for the use of their computers., Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

SeQual-Stream: approaching stream processing to quality control of NGS datasets

  • Castellanos Rodríguez, Óscar
  • Expósito, Roberto R.
  • Touriño, Juan
[Abstract]: Background Quality control of DNA sequences is an important data preprocessing step in many genomic analyses. However, all existing parallel tools for this purpose are based on a batch processing model, needing to have the complete genetic dataset before processing can even begin. This limitation clearly hinders quality control performance in those scenarios where the dataset must be downloaded from a remote repository and/or copied to a distributed file system for its parallel processing. Results In this paper we present SeQual-Stream, a streaming tool that allows performing multiple quality control operations on genomic datasets in a fast, distributed and scalable way. To do so, our approach relies on the Apache Spark framework and the Hadoop Distributed File System (HDFS) to fully exploit the stream paradigm and accelerate the preprocessing of large datasets as they are being downloaded and/or copied to HDFS. The experimental results have shown significant improvements in the execution times of SeQual-Stream when compared to a batch processing tool with similar quality control features, providing a maximum speedup of 2.7 when processing a dataset with more than 250 million DNA sequences, while also demonstrating good scalability features. Conclusion Our solution provides a more scalable and higher performance way to carry out quality control of large genomic datasets by taking advantage of stream processing features. The tool is distributed as free open-source software released under the GNU AGPLv3 license and is publicly available to download at https://github.com/UDC-GAC/SeQual-Stream., Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033, PID2022 also funded by “ERDF A way of making Europe”, EU. Grant ED431C 2021/30, funded by Xunta de Galicia under the Consolidation Program of Competitive Reference Groups. Predoctoral grant of Oscar Castellanos-Rodriguez ref. ED481A 2022/067, also funded by Xunta de Galicia. The funding agencies did not participate in the design of the study and collection, analysis, and interpretation of data and in writing the manuscript., Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED481A 2022/067
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Efficient Cooperative Strategies for Parallel Metaheuristics Using MPI-3 Features

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Pardo, Xoán C.
  • Banga, Julio R.
Versión aceptada: Prado-Rodríguez R, González P, Pardo XC, Banga JR. Efficient cooperative strategies for parallel metaheuristics using MPI-3 features. The International Journal of High Performance Computing Applications. 2026. Copyright © 2026 The Authors DOI: 10.1177/10943420261431588., [Abstract]: This paper explores highly efficient cooperative strategies for population-based parallel metaheuristics, focusing on the integration of shared memory and Remote Memory Access (RMA) operations provided by MPI-3. Most parallel metaheuristic proposals use island-based models with point-to-point communications in their cooperative strategies. These communications can saturate the network and buffers by sending information that often will not be used at the destination, thus resulting in a waste of resources when dealing with these types of applications. In this paper we evaluate other alternative communication protocols that use shared memory windows and RMA operations. Under these new models, the movement of information over the network is on-demand and requested by the source, maximizing resource efficiency. Although the approaches and descriptions in the paper are generic, a particular metaheuristic, the Ant Colony Optimization (ACO), is used to carry out the experiments. The results obtained draw interesting conclusions that can serve to guide the future parallelization of other metaheuristics., RPR, PG and XCP acknowledge funding from grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and “ERDF A way of making Europe”, EU, and Xunta de Galicia through the Consolidation Program of Competitive Reference Groups, ref. ED431 C 2025/33. JRB acknowledges financial support from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU. Authors also acknowledge the Galician Supercomputing Center (CESGA) for the access to its facilities., Xunta de Galicia; ED431 C 2025/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Comparing Portability of FPGA High-Level Synthesis Frameworks in the Context of a Highly-Parallel Application

  • Castro, Manuel de
  • Osorio, Roberto
  • Andújar, Francisco J.
  • Carratalá-Sáez, Rocío
  • Torres, Yuri
  • Llanos, Diego R.
[Abstract]: With the growing popularity of FPGA-based accelerators in HPC applications, new challenges have emerged, particularly in terms of programming and portability. This paper provides an overview of the current state of FPGA tools and their limitations. This study evaluates the performance and portability of two frameworks, SYCL and OpenCL, for developing HPC FPGA solutions. The case of porting a highly-parallel application to FPGAs is studied. First, naïve, low-development-effort implementations are presented using both ND-range and single-task types of kernels, and their performance is evaluated. Subsequently, an optimized FPGA-centric approach is presented and assessed using metrics from the compilation framework. Finally, the different approaches presented are implemented using OpenCL and SYCL and their performance is evaluated. Results reveal that ND-range kernels offer high portability for highly parallel applications, while single-task codes exhibit significantly lower portability. Additionally, SYCL struggles to generate efficient hardware architectures for this kind of application when described as single-task codes, although its performance when following the ND-range approach is surprisingly high., This work was supported in part by Spanish Ministerio de Ciencia e Innovación and the European Regional Development Fund (ERDF) Program of the European Union, (NATASHA Project), under Grant PID2022-142292NB-I00; in part by Junta de Castilla y León-FEDER Grants, (PROPHET-2 Project), Junta de Castilla y León, Spain under Grant VA226P20; in part by MCIN/AEI/10.13039/ 501100011033 through European Union NextGenerationEU/PRTR, under Grant TED2021 130367B I00; and in part by MCIN/AEI/10.13039/501100011033 through ERDF a way of making Europe, EU, under Grant PID2022-136435NB-I00. The work of Manuel De Castro was supported by Spanish Ministerio de Ciencia, Innovación y Universidades, through Ayudas para la Formación de Profesorado Universitario FPU 2022., Junta de Castilla y León; VA226P20
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A new thread-level speculative automatic parallelization model and library based on duplicate code execution

  • Álvarez Martínez, Millán
  • Fraguela, Basilio B.
  • Cabaleiro, José Carlos
  • Rivera, Francisco F.
Funding for open access charge: Universidade da Coruña/CISUG, Loop-efficient automatic parallelization has become increasingly relevant due to the growing number of cores in current processors and the programming effort needed to parallelize codes in these systems efficiently. However, automatic tools fail to extract all the available parallelism in irregular loops with indirections, race conditions or potential data dependency violations, among many other possible causes. One of the successful ways to automatically parallelize these loops is the use of speculative parallelization techniques. This paper presents a new model and the corresponding C++ library that supports the speculative automatic parallelization of loops in shared memory systems, seeking competitive performance and scalability while keeping user effort to a minimum. The primary speculative strategy consists of redundantly executing chunks of loop iterations in a duplicate fashion. Namely, each chunk is executed speculatively in parallel to obtain results as soon as possible and sequentially in a different thread to validate the speculative results. The implementation uses C++11 threads and it makes intensive use of templates and advanced multithreading techniques. An evaluation based on various benchmarks confirms that our proposal provides a competitive level of performance and scalability., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This research was supported by Grants PID2019-104184RB-I00, PID2019-104834GB-I00, PID2022-141623NB-I00, and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU, and the predoctoral Grant of Millán Álvarez Ref. BES-2017-081320, and by the Xunta de Galicia co-founded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2021/30 and ED431C 2022/16). Funding for open access charge: Universidade da Coruña/CISUG. We also acknowledge the support from the Centro Singular de Investigación de Galicia "CITIC" and the Centro Singular de Investigación en Tecnoloxías Intelixentes "CiTIUS", funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grants ED431G 2019/01 and ED431G 2019/04. We also acknowledge the Centro de Supercomputación de Galicia (CESGA)., Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431C 2022/16, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431G 2019/04
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Biclustering in bioinformatics using big data and High Performance Computing applications: challenges and perspectives, a review

  • López-Fernández, Aurelio
  • Gómez-Vela, Francisco A.
  • Rodríguez‑Baena, Domingo S.
  • Delgado‑Chaves, Fernando M.
  • González-Domínguez, Jorge
Financiado para publicación en acceso aberto: Universidad de Sevilla/CBUA, [Abstract]: Biclustering is a powerful machine learning technique that simultaneously groups rows and columns in matrix-based datasets. Applied to gene expression data in bioinformatics, its use has expanded alongside the rapid growth of high-throughput sequencing technologies, leading to massive and complex biological datasets. This review aims to examine how biclustering methods and their validation strategies are evolving to meet the demands of High Performance Computing (HPC) and Big Data environments. We present a structured classification of existing approaches based on the computational paradigms they employ, including MPI/OpenMP, Apache Hadoop/Spark, and GPU/CUDA. By synthesising these developments, we highlight current trends and outline key research challenges. The knowledge gathered in this work may support researchers in adapting and scaling biclustering algorithms to analyse large-scale biomedical data more efficiently. Our contribution is intended to bridge the gap between algorithmic innovation and computational scalability in the context of bioinformatics and data-intensive applications., Funding for open access publishing: Universidad Pablo de Olavide/CBUA and this work was partially supported by grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by ”ERDF A way of making Europe”, EU. It was also funded by Xunta de Galicia [Consolidation Program of Competitive Reference Groups, grant ED431C 2021/30]., Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

STuning-DL: Model-Driven Autotuning of Sparse GPU Kernels for Deep Learning

  • Castro, Roberto L.
  • Andrade, Diego
  • Fraguela, Basilio B.
[Abstract]: The relentless growth of modern Machine Learning models has spurred the adoption of sparsification techniques to simplify their architectures and reduce the computational demands. Network pruning has demonstrated success in maintaining original network accuracy while shedding significant portions of the original weights. However, leveraging this sparsity efficiently remains challenging due to computational irregularities, particularly in GPU kernels. A new trend of template-based GPU kernels for semi-structured sparsity shows promise in efficiency but lacks autotuning capabilities to adapt to input dynamics, often underperforming in scenarios where they have not been meticulously hand-tuned. We present STuning-DL, the first pruning-aware autotuner for third-party template-based implementations enabling efficient optimization of sparse kernels for Deep Learning, spanning from high-level aspects (CUDA C++ level) down to GPU-native instructions specifics (assembly-level). STuning-DL tunes and optimizes at run-time sparse kernels’ performance for each input problem, yielding speedups of up to 5.42× on NVIDIA T4-16GB and up to 3.6× on NVIDIA A100-40GB GPU in sparse matrices from real world models compared to existing heuristics from sparse libraries like cuSparse and cuSparseLt., This work was supported by grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by ‘‘ERDF A way of making Europe’’, EU; also by Xunta de Galicia under the Consolidation Programme of Competitive Reference Groups, ref. ED431C 2021/30. The work of Roberto L. Castro was supported by a predoctoral grant from the Ministry of Science, Innovation and Universities, ref. FPU19/03974., Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Beyond the Premier: Assessing Action Spotting Transfer Capability Across Diverse Domains

  • Cabado, Bruno
  • Cioppa, Anthony
  • Giancola, Marco
  • Villa, Andrés
  • Guijarro-Berdiñas, Bertha
  • Padrón, Emilio J.
  • Ghanem, Bernard
  • Van Droogenbroeck, Marc
Presented at: 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 17-18 June 2024, Seattle, WA, USA © 2024 IEEE. This is the accepted version of the paper, identical to the CVF Open Access version, and is distributed in accordance with IEEE's self-archiving policy. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The Version of Record is available online at: 10.1109/CVPRW63382.2024.00343, [Abstract]: Football stands as one of the most successful sports in history thanks to the plethora of professional leagues broadcasted worldwide followed by avid fans, further fueled by the abundance of amateur and grassroots leagues across nearly every country, encompassing countless players who devote their time to the sport. Despite the tremendous amount of visual data available worldwide for developing automatic systems to extract game events, most efforts focus on the few professional league matches. However, the recording quality and broadcasts editing vary considerably across leagues, creating a disparity in the analytical capabilities of deep learning models. This paper delves into an analysis of how action spotting models transfer to diverse domains, analyzing the performance gap between various types of broadcasts. In particular, we investigate the transfer capability of state-of-the-art action spotting models across leagues, from amateur to professional, and broadcast quality, from AI-piloted camera to professional broadcast editing. Our analysis shows that transferring across leagues is challenging, with the most impactful feature being broadcasting editing quality. This analysis paper therefore seeks to spotlight this pressing issue and catalyze future research endeavors in the field of domain adaptation for action spotting methods., This work was partly supported by Grants PID2019-109238GB-C2 and PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU, and the Xunta de Galicia (ED431C 2022/44, ED431C 2021/30 and ED431F 2021/11). This works was also partly supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research through the Visual Computing Center (VCC) funding and the SDAIA-KAUST Center of Excellence in Data Science and Artificial Intelligence (SDAIA-KAUST AI). Bruno Cabado wish to thanks the Axencia Galega de Innovación the grant received through its Industrial Doctorate program (23/IN606D/2021/2612054). CITIC is funded by Xunta de Galicia (ED431G 2019/01) and ERDF funds. A. Cioppa is funded by the F.R.S.-FNRS., Xunta de Galicia; ED431C 2022/44, Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED431F 2021/11, Xunta de Galicia; 23/IN606D/2021/2612054, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Reseña (Review)

A Parameter Control Strategy for Parallel Island-Based Metaheuristics

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
[Abstract]: In the field of optimisation, the accurate configuration of parameters in metaheuristic algorithms is a critical yet often arduous task that significantly impacts the efficiency and efficacy of the search process. This study was motivated by the need to address the inefficiencies and limitations associated with conventional methods of parameter configuration, which typically involve manual, trial-and-error approaches. These traditional methods can lead to suboptimal performance and increased computational overhead. To tackle these challenges, this study introduces a novel adaptive parameter control strategy for parallel island-based metaheuristics, with a particular emphasis on the ant colony optimisation (ACO) algorithm. Our research process involved extensive experimentation to evaluate the effectiveness of this adaptive strategy. We conducted a series of tests to enable real-time adjustment of key parameters based on the performance of ACO colonies, thereby enhancing both exploration and exploitation capabilities. The results indicate that the adaptive strategy consistently outperforms offline manual and automated tuning configurations, particularly in larger and more complex problem instances, providing a more efficient solution for parameter optimisation in metaheuristics. These findings highlight the potential of dynamic parameter control to reduce dependency on expert knowledge and manual tuning while improving algorithmic performance., This work was supported by Ministerio de Ciencia, Innovación y Universidades and European Regional Development Fund (PID2022-136435NB-I00, PID2020-117271RB- C22, PID2023-146275NB- C22), and by Centro Superior de Investigaciones Científicas (PIE-202470E108)., España. Centro Superior de Investigaciones Científicas; PIE-202470E108
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Applying dynamic balancing to improve the performance of MPI parallel genomics applications

  • Fernández-Fraga, Alejandro
  • González-Domínguez, Jorge
  • Martín, María J.
© ACM 2024. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing (SAC '24)., [Absctract]: Genomics applications are becoming more and more important in the field of bioinformatics, as they allow researchers to extract meaningful information from the huge amount of data generated by the new sequencing technologies. The analysis of these data is a very time consuming task and, therefore, the use of High Performance Computing (HPC) and parallel processing techniques is essential. Although the structure of these applications can be easily adapted to parallel systems by distributing the data to be processed among the available processors, load imbalance is a usual cause of performance degradation. In this paper we propose a dynamic load balancing method based on MPI RMA one-sided communications to minimize the synchronization among processes and the overhead due to communications while improving the workload balance. The strategy is applied, as a case study, to ParRADMeth, an MPI/OpenMP parallel application for the identification of Differential Methylated Regions (DMRs). Results show that the new version of the tool outperforms the previous one in all cases, achieving high performance and scalability. For example, our approach is up to 243 times faster than the sequential version and 1.74 times faster than the previous parallel version when processing a real dataset on a cluster with 8 nodes, each one with 32 CPU cores., This work has been supported by grants PID2019-104184RB-I00 and PID2022-136435NB-I00, both grants funded by MCIN/AEI/ 10.13039/501100011033, PID2022 also funded by "ERDF A way of making Europe", EU; the Ministry of Universities of Spain under grant FPU21/03408; and by Xunta de Galicia and FEDER funds (Centro de Investigación de Galicia accreditation 2019-2022 and Consolidation Program of Competitive Reference Groups, under Grants ED431G 2019/01 and ED431C 2021/30, respectively), Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Pipelined FPGA Implementation of a Differential Evolution Engine for Optimization of Scientific Models

  • Castro, Manuel de
  • Osorio, Roberto
  • Torres, Yuri
  • Llanos, Diego R.
[Abstract]: Custom computing machines implemented on FPGAs have emerged as a powerful solution for tackling computationally intensive tasks, leveraging their capacity for deep pipelining and parallel memory access. Differential Evolution (DE), a robust optimization algorithm, combined with adaptive numerical integration methods, is widely used to optimize parameter values in diverse scientific models. These tasks involve extensive floating-point computations, making FPGAs an ideal platform for efficiently accelerating their execution. In this work, we present a flexible and scalable FPGA architecture optimized for DE. This architecture is tailored to solve complex, resource-intensive optimization problems and is easily customizable for various models and integration methods. To demonstrate its efficacy, we evaluate two case studies: The Hodgkin–Huxley model for neuron action potentials and the Circadian clock model of Arabidopsis thaliana. Our architecture integrates adaptive numerical methods with DE and achieves significant performance and energy efficiency gains over CPU and GPU implementations while maintaining versatility across applications. Our architecture’s modular design enables seamless adaptation across different scientific contexts, enabling further optimization of resource utilization and expansion of application domains. The results underline the potential of FPGAs as a superior platform for large-scale scientific computation, offering unmatched energy efficiency and computational throughput for highly demanding tasks. The code developed to carry out this work is publicly available at https://github.com/mdccUVa/de-fpga., This work was supported in part by the Spanish Ministerio de Ciencia e Innovación and the European Regional Development Fund (ERDF) program of the European Union, under Grant PID2022-142292NB-I00 (NATASHA Project); grant TED2021- 130367B-I00, funded in part by MCIN/AEI/10.13039/501100011033 and by “European Union NextGenerationEU/PRTR”; grant PID2022-136435NB-I00, funded by MICIU/AEI/10.13039/501100011033 and “ERDF A way of making Europe”, EU; and Xunta de Galicia through the Consolidation Program of Competitive Reference Groups, ref. ED431C 2025/33. M. de Castro has been supported by the Spanish Ministerio de Ciencia, Innovación y Universidades, through “Ayudas para la Formación de Profesorado Universitario FPU 2022.” This research was supported by grants from NVIDIA and utilized an NVIDIA A100 GPU, Xunta de Galicia; ED431C 2025/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Weight-based Disk I/O Scaling for Serverless Containers

  • Castellanos Rodríguez, Óscar
  • Expósito, Roberto R.
  • Enes, Jonatan
  • Touriño, Juan
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The source code of the mechanism presented in this paper is available at https://github.com/oscar-castellanos/ServerlessIOScaling., [Abstract]: Disk bandwidth is a critical resource for I/O-intensive applications that must transfer large volumes of data to and from persistent storage. Most multi-tenant infrastructures efficiently allocate CPU and memory resources to concurrent workloads, but typically lack mechanisms for allocating I/O bandwidth. As a result, users often resort to exclusive node reservations to avoid disk contention, which can lead to underutilisation of other node resources if not fully exploited. Another common issue is that users do not know the exact resource requirements of their applications. Even when this is known, applications rarely maintain peak resource usage throughout their entire execution, resulting in wasted resources that could otherwise benefit other users. Today, many users prefer cloud serverless platforms because of their ease of use and flexible billing. However, these platforms have inherent limitations and may not be suitable for workloads with specific requirements. In this paper, we present a serverless scaling mechanism that dynamically adjusts disk I/O bandwidth for containerised applications by scaling their allocation up or down based on real-time usage and configurable weights. In addition, the system incorporates automatic extension management capabilities for virtual disk devices, such as logical volumes. Our approach can be integrated with other serverless scaling mechanisms, such as CPU and memory management, to provide a comprehensive resource scaling solution. The experimental results have shown significant performance improvements, with overall runtime reductions of up to 53% for concurrent I/O-intensive workloads compared to running them without serverless capabilities., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported by grants PID2022-136435NB-I00 and TED2021-129177B-I00, funded by the Ministry of Science, Innovation and Universities of Spain, MICIU/AEI/10.13039/501100011033 (PID2022 also funded by “ERDF A way of making Europe”, EU, and TED2021 by “NextGenerationEU”/PRTR). It was also supported by the Consolidation Program of Competitive Reference Groups of Xunta de Galicia (ref. ED431C 2025/33). CITIC, as a centre accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (ref. ED431G 2023/01). O. Castellanos is also supported by Xunta de Galicia (predoctoral fellowship ED481A 2022/067). Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2025/33, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED481A 2022/067
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A Multi-Backend Autotuning Study of Feature Selection on GPUs

  • Beceiro, Bieito
  • González-Domínguez, Jorge
  • Pérez Diéguez, Adrián
  • Ibrahim, Khaled Z.
  • Touriño, Juan
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The code for the CUDA, HIP, and SYCL backends for mRMR used in the experimental evaluation is available at https://gitlab.com/bieito/gpufs. The datasets analyzed in this study are available in the LIBSVM repository, https://www.csie.ntu.edu.twcjlin/libsvmtools/datasets/, [Abstract]: Feature selection is an important step in machine learning that can benefit from GPU acceleration. As the number of GPU vendors increases, it is imperative to adapt algorithms such as the minimum Redundancy Maximum Relevance (mRMR) feature selection method to different backends that support several GPU architectures. This work presents a multi-backend implementation of mRMR across CUDA, HIP, and SYCL, and studies its performance when combined with Bayesian optimization and transfer learning to automatically tune execution parameters for different platforms and datasets. Our experimental results show that when tuned, CUDA and HIP achieve comparable performance on NVIDIA architectures, while SYCL exhibits a moderate performance gap. Overall, this work highlights the impact of backend choice and autotuning on GPU-accelerated feature selection and provides insights into deploying mRMR across heterogeneous environments., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported by grants PID2022-136435NB-I00 and PID2025-167767NB-I00, funded by MICIU/AEI/10.13039/501100011033 and “ERDF A way of making Europe”, EU; grant TSI-100925-2023-1, funded by the Ministry for Digital Transformation and Civil Service and Next-GenerationEU/RRF; FPU predoctoral grant of Bieito Beceiro ref. FPU20/00997, funded by the Ministry of Science, Innovation and Universities; and INDITEX-UDC Predoctoral Research Stay Grants Program 2024. In addition, this material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Scientific Discovery through Advanced Computing (SciDAC) program under Award Number DE-AC02-05CH11231. Funding for open access charge: Universidade da Coruña/CISUG., United States. Department of Energy; DE-AC02-05CH11231, https://gitlab.com/bieito/gpufs
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Multistage strategy for ground point filtering on large-scale datasets

  • Teijeiro, Diego
  • Amor, Margarita
  • Buján, Sandra
  • Richter, Rico
  • Döllner, Jürgen
The point clouds and LiDAR datasets used in this work belong to the LiDAR-PNOA data repository, region of Navarra, and were provided by Gobierno de Navarra. Dataset license: LiDAR-PNOA-cob2 2017 CC-BY 4.0 scne.es., [Abstract]: Ground point filtering on national-level datasets is a challenge due to the presence of multiple types of landscapes. This limitation does not simply affect to individual users, but it is in particular relevant for those national institutions in charge of providing national-level Light Detection and Ranging (LiDAR) point clouds. Each type of landscape is typically better filtered by different filtering algorithms or parameters; therefore, in order to get the best quality classification, the LiDAR point cloud should be divided by the landscape before running the filtering algorithms. Despite the fact that the manual segmentation and identification of the landscapes can be very time intensive, only few studies have addressed this issue. In this work, we present a multistage approach to automate the identification of the type of landscape using several metrics extracted from the LiDAR point cloud, matching the best filtering algorithms in each type of landscape. An additional contribution is presented, a parallel implementation for distributed memory systems, using Apache Spark, that can achieve up to 34 x of speedup using 12 compute nodes., We wish to acknowledge the support received from the Centro de Investigación de Galicia ”CITIC”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014–2020 Program), by grant ED431G 2019/01. This research was funded by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00/AEI/10.13039/501100011033), by the Galician Government under the Consolidation Program of Competitive Research Units (Ref. ED431C 2021/30) and by grant PID2022-136435NB-I00, funded by MCIN/AEI/ 10.13039/501100011033 and by "ERDF A way of making Europe", EU. Diego Teijeiro received financial support from Xunta de Galicia and the European Social Fund (ESF) of the European Union (predoctoral fellowship ref. ED481A-2019/231). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/30, Xunta de Galicia; ED481A-2019/231
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

CUDA Acceleration of Feature Selection Methods Based on Conditional Mutual Information

  • Beceiro, Bieito
  • González-Domínguez, Jorge
  • Touriño, Juan
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Feature Selection (FS) is a fundamental data mining technique that improves machine learning models by eliminating irrelevant or redundant data, especially as dataset dimensions continue to grow. However, greedy FS methods can be com¬putationally intensive, particularly for large datasets. This work focuses on the development of CUDA implementations for FS methods that use Conditional Mutual Information (CMI). Specifically, we address the Interaction Capping (ICAP) method and the family of algorithms that can be included in the BetaGamma space. The proposed implementations lever¬age memory hierarchy, asynchronous computation, and a reduced-precision approach to efficiently exploit the hardware of NVIDIA GPUs to achieve high performance with relatively low energy costs. The experimental evaluation has been carried out in two systems with different types and numbers of CPUs and GPUs using four publicly available datasets from different fields. We first provide insight into the performance impact of each optimization technique, and also into the combination of configuration parameters that best exploits the GPU architecture. Finally, the novel GPU implementa¬tions are compared to their fastest available counterparts (parallel implementations for multi-CPU systems), proving that the GPU versions are significantly faster than these multithreaded approaches in all scenarios using 32 or 64 CPU cores., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was sup¬ported by grant PID2022-136435NB-I00, funded by MICIU/ AEI/10.13039/501100011033 and “ERDF A way of making Europe” (EU), grant TSI-100925-2023-1, funded by the Ministry for Digital Transformation and Civil Service, and FPU predoctoral grant of Bieito Beceiro ref. FPU20/00997, funded by the Ministry of Science, Inno¬vation and Universities. It was also supported by the Consolidation Program of Competitive Reference Groups of Xunta de Galicia (ref. ED431C 2025/33). Funding for open access charge: Universidade da Coruña/CISUG, Xunta de Galicia; ED431C 2025/33
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Serverless-like platform for container-based YARN clusters

  • Castellanos Rodríguez, Óscar
  • Expósito, Roberto R.
  • Enes, Jonatan
  • Taboada, Guillermo L.
  • Touriño, Juan
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Serverless computing is an emerging paradigm that has gained a lot of relevance in recent years, as it allows users to consume computing resources without worrying about the underlying infrastructure and pay only for what they actually use. Most current services that implement this paradigm typically rely on the Function-as-a-Service (FaaS) model, which works perfectly for simple applications based on stateless functions triggered by specific events. However, these services are not designed to run more complex applications with intricate interactions, usually presenting a significant degree of configuration difficulty and/or low ability to customise the execution environment. They also tend to be designed for short and simple workloads, with some services even limiting their maximum runtime to just a few minutes. In this paper, we present a platform based on Hadoop YARN oriented to the execution of Big Data workloads in a containerised and serverless way, so that the resources allocated to such containers are automatically and dynamically scaled according to their actual usage. An experimental evaluation has been carried out to compare our serverless-like platform with a standard YARN deployment when executing Big Data workloads concurrently. Our results have shown experimental evidence of enhancing both performance and overall resource efficiency, providing runtime reductions and resource usage improvements of up to 41% and 50%, respectively., This work was supported by grants PID2019-104184RB-I00, PDC20 21-121309-I00, TED2021-129177B-I00 and PID2022-136435NB-I00, funded by the Ministry of Science and Innovation of Spain, MCIN/AEI/ 10.13039/501100011033 (PDC2021 and TED2021 also funded by ‘‘NextGenerationEU’’/PRTR, and PID2022 by ‘‘ERDF A way of making Europe’’, EU). It was also supported by Xunta de Galicia, Spain (predoctoral fellowship ED481A 2022/067). Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED481A 2022/067
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Should I render or should AI Generate? Crafting Synthetic Semantic Segmentation Datasets with Controlled Generation

  • Mures, Omar A.
  • Silva, Manuel
  • Lijó-Sanchez, Manuel
  • Padrón, Emilio J.
  • Iglesias-Guitian, Jose A.
Versión aceptada, publicada en modo "Early Publication" por el editor., [Abstract]: This work explores the integration of generative AI models for automatically generating synthetic image-labeled data. Our approach leverages controllable Diffusion Models to generate synthetic variations of semantically labeled images. Synthetic datasets for semantic segmentation struggle to represent real-world subtleties, such as different weather conditions or fine details, typically relying on costly simulations and rendering. However, Diffusion Models can generate diverse images using input text prompts and guidance images, like semantic masks. Our work introduces and tests a novel methodology for generating labeled synthetic images, with an initial focus on semantic segmentation, a demanding computer vision task. We showcase our approach in two distinct image segmentation domains, outperforming traditional computer graphics simulations in efficiently creating diverse datasets and training downstream models. We leverage generative models for crafting synthetically labeled images, posing the question: “Should I render or should AI generate?”. Our results endorse a paradigm shift towards controlled generation models, Xunta de Galicia: ED431F 2021/11, Xunta de Galicia: ED431G 2019/01, The authors would like to thank José R. López from Deep Design Systems S.L. for the car parts dataset (PART). This work has been supported by Xunta de Galicia: ED431F 2021/11 and ED431G 2019/01. It was also partially supported through the research projects AEI/PID2020-115734RB-C22 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by ‘ERDF A way of making Europe’, EU. Jose A. Iglesias-Guitian also acknowledges the UDC-Inditex InTalent programme and the Spanish Ministry of Science and Innovation (AEI/RYC2018-025385-I)
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

DeWDRoP: An Automated Framework for Detecting and Characterizing Welding Defects Using High-Density Point Clouds

  • Vidal Miramontes, Sergio Constantino
  • Regueiro, Carlos V.
  • Amor, Margarita
  • Mayobre, Pablo
  • Antelo, Berta
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] A stringent, stable, and accurate system for the detection of welding defects is essential in Industry 4.0 manufacturing environments, aiming for near-zero defects. This work introduces DeWDRoP, an offline system for detecting and characterizing welding defects using high-density point clouds (between 20 and 30 million points, with a resolution over 130 μ m). We propose a novel theoretical framework based on two key innovations: region-based seam extraction (RBSE), a segmentation method tailored to isolate welding seams (WSs) from high-density point clouds, and tolerance-based deviation analyzer (TBDA), a method that quantifies local deviations for geometry tolerance evaluation. These methods improve the identification, classification, and characterization of defects. The system is designed to augment the capabilities of expert nondestructive testing (NDT) inspectors, facilitating more precise and consistent evaluations. Experiments on real weld datasets confirm the framework’s suitability for high-quality manufacturing environments. It accurately identifies spatters, pores, and fillet weld asymmetries, achieving a recall rate of 98.48% and a Type II error of 1.52%., This work has been supported by Centro Mixto de Investigacion UDC-Navantia (IN853C ´2022/01), funded by GAIN (Xunta de Galicia) and ERDF Galicia 2021-2027; and by grant PID2022-136435NB-I00, funded by MICIU/AEI/ 10.13039/501100011033 and by ”ERDF A way of making Europe”, EU; in part by ED431G 2023/01, funded by Xunta de Galicia and FEDER funds of the EU; in part by ED431C 2025/33 funded by Xunta de Galicia under the Consolidation Program of Competitive Reference Groups; and in part by Universidade da Coruna/CISUG funding for open access charge, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED431C 2025/33
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Accelerating Scientific Model Optimization with a Pipelined FPGA-Based Differential Evolution Engine

  • Castro, Manuel de
  • Osorio, Roberto
  • Torres, Yuri
  • Llanos, Diego R.
Traballo presentado en 2025 IEEE 33rd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 04-07 May 2025, Fayetteville, AR, USA., [Abstract]: Custom computing machines on FPGAs excel in solving computationally intensive tasks by leveraging deep pipelines and parallel memory access. This paper introduces a flexible FPGA-based architecture for Differential Evolution (DE), optimized for a variety of scientific models and numerical integration methods. The architecture's modular design allows seamless customization for diverse applications. Two case studies demonstrate the architecture's capabilities: the Hodgkin-Huxley model for neuron action potentials and the Circadian model of Arabidopsis thaliana. These implementations employ double-precision floating-point arithmetic and adaptive numerical integration techniques, addressing the challenges of complex, stiff differential equations. The proposed design outperforms CPUs and GPUs in computational speed and energy efficiency, achieving up to 3.8x faster processing and significant reductions in energy consumption. This work highlights the potential of FPGA platforms for accelerating complex scientific computations while providing insights for future optimizations in resource utilization and broader applicability., This work was supported in part by Grant PID2022-142292NB-100 (NATASHA Project); by grant TED2021-130367B-I00, funded by MCIN/AEI/10.13039/ 501100011033; and by MCIN/AEI/10.13039/501100011033 through the EU Grant PID2022-136435NB-100. Manuel de Castro has been supported by a FPU 2022 grant. This research was supported by grants from NVIDIA and utilized NVIDIA A100. The authors would like to thank Sergio Alonso Pascual for his help developing the GPU software used.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

BigDEC: A multi-algorithm Big Data tool based on the k-mer spectrum method for scalable short-read error correction

  • Expósito, Roberto R.
  • González-Domínguez, Jorge
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Despite the significant improvements in both throughput and cost provided by modern Next-Generation Sequencing (NGS) platforms, sequencing errors in NGS datasets can still degrade the quality of downstream analysis. Although state-of-the-art correction tools can provide high accuracy to improve such analysis, they are limited to apply a single correction algorithm while also requiring long runtimes when processing large NGS datasets. Furthermore, current parallel correctors generally only provide efficient support for shared-memory systems lacking the ability to scale out across a cluster of multicore nodes, or they require the availability of specific hardware devices or features. In this paper we present a Big Data Error Correction (BigDEC) tool that overcomes all those limitations by: (1) implementing three different error correction algorithms based on the widely extended k-mer spectrum method; (2) providing scalable performance for large datasets by efficiently exploiting the capabilities of Big Data technologies on multicore clusters based on commodity hardware; (3) supporting two different Big Data processing frameworks (Spark and Flink) to provide greater flexibility to end users; (4) including an efficient, stream-based merge operation to ease downstream processing of the corrected datasets; and (5) significantly outperforming existing parallel tools, being up to 79% faster on a 16-node multicore cluster when using the same underlying correction algorithm. BigDEC is publicly available to download at https://github.com/UDC-GAC/BigDEC., This work was supported by grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by the Ministry of Science and Innovation of Spain, MCIN/AEI/10.13039/501100011033 (PID2022 also funded by “ERDF A way of making Europe”, EU). It was also funded by Xunta de Galicia [Consolidation Program of Competitive Reference Groups, grant ED431C 2021/30]. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2021/30
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

TNBS: A Kernel-Based Benchmarking for Digital Quantum Computers

  • Ferro, Gonzalo
  • Odubanjo, Oluwatosín Esther
  • Andrade, Diego
  • Gómez Tato, Andrés
Presented to Euro-Par 2024: Parallel Processing Workshops, Madrid, Spain, August 26–30, 2024., [Abstract]: The systematic evaluation of the performance of Quantum Computers allows users to identify the best platform to execute a certain class of workload, and it can also guide the future developments of hardware companies. The NEASQC Benchmark Suite (TNBS) is a methodology designed in the context of the NEASQC (NExt ApplicationS of Quantum Computing) European project to perform such evaluation across several benchmark cases identified as common in one or several domains of application of Quantum Computing. TNBS follows several design principles identified as relevant after a thorough evaluation of the existing benchmarking methodologies: (1) benchmarks are defined at high-level not being linked to any algorithmic approach or implementation, (2) benchmarks are scalable (in qubits) and their output is classically verifiable, (3) performance metrics may be defined per case to fit the nature of the outputs of each case, and (4) the benchmark report also keeps record of all the relevant components of the execution stack. Finally, in the future, the reports may be submitted to a centralized repository, which is equipped with a web interface allowing a systematic and objective comparison of different platforms across the different cases. The first release of TNBS is composed of 4 benchmark cases and provides a reference implementation in myQLM. Documentation and code are available at https://github.com/NEASQC/WP3_Benchmark., All authors acknowledge the European Project NExt ApplicationS of Quantum Computing (NEASQC), funded by Horizon 2020 Program inside the call H2020-FETFLAG-2020-01 (Grant Agreement 951821). Grant PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe”, EU. Grant for the Predoctoral contract of O.E. Odubanjo ref. PREP2022-000281 funded by MCIN/AEI/10.13039/501100 011033 and by ESF+. The authors also acknowledge Galicia Supercomputing Center (CESGA) for providing access to FinisTerrae III supercomputer with financing from the Programa Operativo Plurirregional de España 2014-2020 of ERDF, ICTS-2019-02-CESGA-3. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01)., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ICTS-2019-02-CESGA-3, https://github.com/NEASQC/WP3_Benchmark
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
19 páginas, 11 figuras, 6 tablas, Binary combinatorial optimization plays a crucial role in various scientific and engineering fields. While deterministic approaches have traditionally been used to solve these problems, stochastic methods, particularly metaheuristics, have gained popularity in recent years for efficiently handling large problem instances. Ant Colony Optimization (ACO) is among the most successful metaheuristics and is frequently employed in non-binary combinatorial problems due to its adaptability. Although for binary combinatorial problems ACO can suffer from issues such as rapid convergence to local minima, its eminently parallel structure means that it can be exploited to solve large and complex problems also in this field. In order to provide a versatile ACO implementation that achieves competitive results across a wide range of binary combinatorial optimization problems, we introduce a parallel multicolony strategy with an improved cooperation scheme to maintain search diversity. We evaluate our proposal (Binary Parallel Cooperative ACO, BiPCACO) using a comprehensive benchmark framework, showcasing its performance and, most importantly, its flexibility as a successful all-purpose solver for binary combinatorial problems., RPR, PGG and RDB acknowledges funding from Grants PID2019-104184RB-I00 and PID2022-136435NB-I00, funded by MCIN/AEI/10.13039/501100011033, PID2022 also funded by ‘ERDF A way of making Europe’, EU; Xunta de Galicia and FEDER funds of the EU (Consolidation Program of Competitive Reference Groups, ref. ED431C 2021/30). JRB acknowledges funding from the Ministry of Science and Innovation of Spain MCIN/AEI/10.13039/501100011033 through grant PID2020-117271RB- C22 (BIODYNAMICS). Authors also acknowledge the Galician Supercom- puting Center (CESGA) for the access to its facilities. Funding for open access charge: Universidade da Coruña/CISUG, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Population based metaheuristics in Spark: Towards a general framework using PSO as a case study

  • Pardo, Xoán C.
  • Gonzalez, Patricia
  • Banga, Julio R.
  • Doallo, Ramón
26 pages, 19 figures, 16 tables; The code and data used for this research are available in public repositories referenced in the article., Over the years metaheuristics have been successfully applied to optimization problems in many real-world applications. The increasing complexity and scale of the problems addressed has posed new challenges to researchers in the field. The application of distributed metaheuristics is a common approach to speed up the time to solution or improve its quality by leveraging traditional parallel programming models on platforms like multicore processors or computer clusters. More recently, the emergence of Cloud Computing and new programming models and frameworks for Big Data has facilitated access to an unprecedented amount of computational resources, which led to a growing interest in optimization frameworks that support the development and execution of distributed metaheuristics taking advantage of this potential. In this paper, we present the current status of development of one such framework that aims to provide support for the application of distributed population-based metaheuristics to the global optimization of large-scale problems in Spark. The framework provides a reduced set of abstractions to represent the general structure of population-based metaheuristics as templates and strategies to particularize them into concrete metaheuristics, as well as other nice features like out of the box implementations of the most common distributed models, full configurability through a human-friendly format, and the possibility of rapid prototyping and testing metaheuristics in the Spark shell. To validate the approach, a template for Particle Swarm Optimization (PSO) was implemented as a proof of concept, which includes strategies for instantiating different variants of the algorithm, configurable topologies, and sequential and distributed execution models., This work was supported by MCIN/AEI/10.13039/501100011033 [grant numbers PID2019-104184RB-I00, PID2022-136435NB-I00 and PID2020-117271RB-C22 (BIODYNAMICS)], PID2022 also funded by “ERDF A way of making Europe”, EU. Also supported by Xunta de Galicia [grant number ED431C 2021/30]. Funding for open access charge: Universidade da Coruña/CISUG ., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A Parameter Control Strategy for Parallel Island-Based Metaheuristics

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Banga, Julio R.
In the field of optimisation, the accurate configuration of parameters in metaheuristic algorithms is a critical yet often arduous task that significantly impacts the efficiency and efficacy of the search process. This study was motivated by the need to address the inefficiencies and limitations associated with conventional methods of parameter configuration, which typically involve manual, trial-and-error approaches. These traditional methods can lead to suboptimal performance and increased computational overhead. To tackle these challenges, this study introduces a novel adaptive parameter control strategy for parallel island-based metaheuristics, with a particular emphasis on the ant colony optimisation (ACO) algorithm. Our research process involved extensive experimentation to evaluate the effectiveness of this adaptive strategy. We conducted a series of tests to enable real-time adjustment of key parameters based on the performance of ACO colonies, thereby enhancing both exploration and exploitation capabilities. The results indicate that the adaptive strategy consistently outperforms offline manual and automated tuning configurations, particularly in larger and more complex problem instances, providing a more efficient solution for parameter optimisation in metaheuristics. These findings highlight the potential of dynamic parameter control to reduce dependency on expert knowledge and manual tuning while improving algorithmic performance., This work was supported by Ministerio de Ciencia, Innovación y Universidades and European Regional Development Fund (PID2022-136435NB-I00, PID2020-117271RB-C22, PID2023-146275NB-C22), and by Centro Superior de Investigaciones Científicas (PIE-202470E108).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Efficient cooperative strategies for parallel metaheuristics using MPI-3 features

  • Prado-Rodríguez, Roberto
  • González, Patricia
  • Pardo, Xoan C.
  • Banga, Julio R.
23, páginas, 8 figuras, 8 tablas, This paper explores highly efficient cooperative strategies for population-based parallel metaheuristics, focusing on the integration of shared memory and Remote Memory Access (RMA) operations provided by MPI-3. Most parallel metaheuristic proposals use island-based models with point-to-point communications in their cooperative strategies. These communications can saturate the network and buffers by sending information that often will not be used at the destination, thus resulting in a waste of resources when dealing with these types of applications. In this paper we evaluate other alternative communication protocols that use shared memory windows and RMA operations. Under these new models, the movement of information over the network is on-demand and requested by the source, maximizing resource efficiency. Although the approaches and descriptions in the paper are generic, a particular metaheuristic, the Ant Colony Optimization (ACO), is used to carry out the experiments. The results obtained draw interesting conclusions that can serve to guide the future parallelization of other metaheuristics., The authors disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by Ministerio de Ciencia, Innovación y Universidades and European Regional Development Fund (PID2022-136435NB-I00, PID2023-146275NB-C22), and by Xunta de Galicia (Consolidation Program of Competitive Reference Groups, ref. ED431 C 2025/33)., Peer reviewed