Skip to main content

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication 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
Publication 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
Publication 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
Publication 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
RUC. Repositorio da Universidade da Coruña
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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: Universidade da Coruña/CISUG, [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
Publication 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
Publication 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
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [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.
RUC. Repositorio da Universidade da Coruña
Publication 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
Publication 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
Publication 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
Publication 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.
Financiado para publicación en acceso aberto: 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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