Pasar al contenido principal

COMPUTACION AVANZADA PARA LOS RETOS DE LA SOCIEDAD DIGITAL-UAB

PID2020-113614RB-C21

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

Resultados relacionados

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

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

Accelerating Edit-Distance Sequence Alignment on GPU Using the Wavefront Algorithm

  • Aguado-Puig, Quim|||0000-0003-4871-3192
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Moure, Juan C.|||0000-0001-6697-0331
  • Castells-Rufas, David|||0000-0002-7181-9705
  • Alvarez, Lluc
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Moreto, Miquel|||0000-0002-9848-8758
Sequence alignment remains a fundamental problem with practical applications ranging from pattern recognition to computational biology. Traditional algorithms based on dynamic programming are hard to parallelize, require significant amounts of memory, and fail to scale for large inputs. This work presents eWFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute the exact edit-distance sequence alignment based on the wavefront alignment algorithm (WFA). This approach exploits the similarities between the input sequences to accelerate the alignment process while requiring less memory than other algorithms. Our implementation takes full advantage of the massive parallel capabilities of modern GPUs to accelerate the alignment process. In addition, we propose a succinct representation of the alignment data that successfully reduces the overall amount of memory required, allowing the exploitation of the fast shared memory of a GPU. Our results show that our GPU implementation outperforms by 3- 9× the baseline edit-distance WFA implementation running on a 20 core machine. As a result, eWFA-GPU is up to 265 times faster than state-of-the-art CPU implementation, and up to 56 times faster than state-of-the-art GPU implementations.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

WFA-GPU: Gap-affine pairwise read-alignment using GPUs

  • Aguado-Puig, Quim|||0000-0003-4871-3192
  • Doblas, Max
  • Matzoros, Christos
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Moure, Juan C.|||0000-0001-6697-0331
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Moreto, Miquel|||0000-0002-9848-8758
Advances in genomics and sequencing technologies demand faster and more scalable analysis methods that can process longer sequences with higher accuracy. However, classical pairwise alignment methods, based on dynamic programming (DP), impose impractical computational requirements to align long and noisy sequences like those produced by PacBio and Nanopore technologies. The recently proposed wavefront alignment (WFA) algorithm paves the way for more efficient alignment tools, improving time and memory complexity over previous methods. However, high-performance computing (HPC) platforms require efficient parallel algorithms and tools to exploit the computing resources available on modern accelerator-based architectures. This paper presents WFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute exact gap-affine alignments based on the WFA algorithm. We present the algorithmic adaptations and performance optimizations that allow exploiting the massively parallel capabilities of modern GPU devices to accelerate the alignment computations. In particular, we propose a CPU-GPU co-design capable of performing inter-sequence and intra-sequence parallel sequence alignment, combining a succinct WFA-data representation with an efficient GPU implementation. As a result, we demonstrate that our implementation outperforms the original multi-threaded WFA implementation by up to 4.3× and up to 18.2× when using heuristic methods on long and noisy sequences. Compared to other state-of-the-art tools and libraries, the WFA-GPU is up to 29× faster than other GPU implementations and up to four orders of magnitude faster than other CPU implementations. Furthermore, WFA-GPU is the only GPU solution capable of correctly aligning long reads using a commodity GPU. WFA-GPU code and documentation are publicly available at https://github.com/quim0/WFA-GPU.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Automatizando y acelerando el procesamiento de Datos LiDAR con IA

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Suppi, Remo|||0000-0002-0373-8292
  • Carrillo, Carlos|||0000-0003-3606-7517
Con los avances tecnológicos recientes, los datos LiDAR están siendo cada vez más solicitados y utilizados en diversas áreas, no solo para visualización, sino también en la planificación urbana, la gestión forestal y otras aplicaciones administrativas. Para aprovechar eficazmente los datos LiDAR, es esencial georreferenciarlos, limpiarlos y clasificarlos. Estos procesos pueden realizarse manualmente, donde un operador asigna etiquetas o elimina puntos, o mediante algoritmos y técnicas de aprendizaje automático que automatizan el proceso. Sin embargo, persisten muchas limitaciones en estos procesos debido al tamaño de las nubes de puntos LiDAR y al costo computacional asociado para procesarlos. Para abordar este desafío, en este trabajo se propone una metodología para automatizar y acelerar el procesamiento de nubes de puntos, que incluye la asignación de color a cada punto, la eliminación de superposiciones y ruido, así como la clasificación de los puntos, entre otras tareas. Este proceso se paralelizará y se ejecutará en entornos cloud.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Edge computing driven forest fire spread simulation, An energy-aware study

  • Carrillo, Carlos|||0000-0003-3606-7517
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Cortés Fité, Ana|||0000-0003-1697-1293
An accurate and fast prediction of forest fire evolution is a crucial issue to minimize its impact. One of the challenges facing forest fire spread simulators is the uncertainty surrounding the input data. While high-performance computing (HPC) platforms help reduce these uncertainties, their accessibility during emergencies is limited due to infrastructure constraints. real time data collection using sensors onboard Unmanned Aerial Vehicles (UAVs) in real time can significantly reduce their uncertainty. However, transmitting this data to HPC environments and returning the results to firefighters remains difficult, especially in areas with poor connectivity. We propose using Edge Computing to address these challenges, leveraging low-consumption GPU-accelerated embedded systems for in situ data processing and wildfire spread simulation. For simulation purposes, the FARSITE forest fire spread simulator has been used. This work aims to demonstrate the feasibility of leveraging Embedded Systems with low-consumption GPUs to simulate short-term forest fire spread evolution (up to 5 hours) at high resolution (5 meters). The obtained results highlight that these devices can gather data, simulate the hazard, and deliver prediction results in situ, even without connectivity, opening up the possibility of monitoring and predicting fire behavior at high resolution without employing HPC platforms.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Zone adaptive fuel mapping for high resolution wildfire spread forecasting

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Suppi, Remo|||0000-0002-0373-8292
  • Margalef, Tomàs|||0000-0001-6384-7389
Extreme wildfire events (EWE), although a rare natural hazard, account for a substantial portion of global wildfire damage, requiring proactive anticipation and mitigation due to their increasing occurrence. Wildfire spread simulators are crucial for reducing damage, but they rely heavily on accurate fuel maps, which are often outdated, have low resolution, or are unavailable in many regions. While land cover maps are more up-to-date, high-resolution globally, and widely available, there is no universally accepted method to convert land cover maps into fuel maps. In this work, an automatic methodology for generating high-resolution fuel maps from land cover maps called zone-adaptive fuel mapping (ZAFM) is proposed. ZAFM is a consistent local approach that makes use of public resources to create a fuel map. The proposed methodology has been tested using, as a study case, an EWE that occurred in the north-east of Spain during the summer of 2022. To assess the accuracy of the proposed fuel mapping method, we compared the fire spread forecast using the ZAFM fuel map with fire evolutions based on different fuel maps derived from the land cover map of the study area. The accuracy assessment, based on the F2-score metric, reveals that ZAFM achieves the highest F2-score of approximately 0.90, while the F2-scores for the other fuel maps range from 0.78 to 0.89, with no individual simulation reaching 0.90. ZAFM was also evaluated against other publicly available fuel maps covering Catalonia, and once again achieved higher F2-scores in the case study simulations. These results highlight the superior predictive performance of ZAFM and underscore the importance of using up-to-date, high-resolution data to improve wildfire spread forecasts. Furthermore, since ZAFM relies on open-access data maps, it can be applied worldwide with any available high-resolution land cover map.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Remote sensing AI for crop planting in wildfire fuel mapping

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Suppi, Remo|||0000-0002-0373-8292
Accurate wildfire prediction requires updated, high-resolution fuel maps that account for seasonal vegetation variations. The flammability of crops varies by season, affecting the behavior of wildfires. This study combines remote sensing indices and machine learning to dynamically update fuel models in cropland zones. Using Sentinel-2 data, the status of the cropland is classified as "planted" or "unplanted", achieving 80% accuracy. Applied to a 2019 wildfire in Catalonia (Spain), the updated fuel map closely matched the observed fire spread. The methodology outperforms traditional approaches and is efficient, allowing for real-time updates based on seasonal changes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Realistic wildfire growth simulations applying a differentiable parametric representation of the fire front based on Composite Bézier curves

  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
Modelling the evolution of a forest fire in Wildland Urban Interface (WUI) areas is still a major challenge in the field of forest fire simulation. Most existing forest fire spread simulators are based on polygonal representations of the fire perimeter, which often fail to capture the complexities of fire behaviour in these areas. Elliptical Wave Propagation (EWP) based simulators rely on this type of forest fire perimeter representation, that is, they represent the fire perimeter as a series of points connected by straight lines where the evolution of the fire front is performed by evaluating the spread of each perimeter point using as the spread direction the direction of the normal vector at each of them. To this end, EWP-based simulators have been built on top of the Richard model, which uses a differentiable parametric representation of the fire front. However, due to the polygonal representation used by EWP-based simulators, these cannot exploit the mathematical potential of using a parametric representation of the fire perimeter, which could compromise the accuracy of the simulations. To address these limitations, we propose a novel parametric representation of the fire front using Composite Bézier Curves (CBC). The proposed wildfire perimeter representation improves the realism of the fire shapes being smooth and rounded. The first implementation of this proposal was done keeping the original method of normal vector calculation. This approach has been called Composite Bézier Curves using Neighbours (CBCN). However, an improved methodology has also been proposed where a more accurate method for calculating the normal vector directions is used, which is aligned with the curvatures of the fire front, thereby improving the overall modelling of fire dynamics. This advanced proposal has been called Composite Bézier Curves using Differentials (CBCD). Both proposed methodologies have been integrated into FARSITE, a well-known EWP-based forest fire spread simulator. Traditional polygonal representation (LIN) and the new CBC-based approach (CBCN and CBCD) were tested in ideal scenarios and two real cases. The obtained results show that any CBC-based representation generates more realistic fire shapes and they also enhance the simulator's ability to model fire spread in WUI areas, with CBCD being the proposal that obtains the best results.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A methodology for selecting a performance-convenient ABMS development framework on HPC platforms

  • Moreno Vendrell, Andreu|||0000-0002-0784-7138
  • Jorba i Esteve, Josep|||0000-0002-5810-4748
  • Peralta Quesada, Cristina|||0009-0002-0155-7102
  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Sikora, Anna|||0000-0003-0090-4109
  • Hanzich, Mauricio|||0000-0003-4460-1118
Agent-based modeling and simulation (ABMS) is an approach for simulating the actions and interactions of autonomous agents. Such interactions occur within a defined environment to assess their effects on a system as a whole. Depending on the complexity of the model and the number of simulated agents, an ABMS application may require a significant amount of computational resources. It makes them good candidates to be parallelized on HPC systems. However, most developers of ABMS simulators are experts in the specific simulation domain, but they lack the expertise to develop parallel applications. Consequently, several frameworks for generating HPC ABMS applications have been developed, and it may now be challenging for these non-expert users to choose which of these frameworks would provide the best performing simulator for a particular model. This paper presents a methodology that uses a benchmark to help non-expert users to select the most suitable framework to generate the best performing parallel implementation for a given ABMS model. Such a benchmark considers the common characteristics of parallel ABMS applications and includes parameters for influencing their relevant performance aspects. The methodology is based on defining a set of problem classes that represent the majority of known ABMS models and systematically conducting a series of experiments to determine which framework offers the best performance for each class. Then, users only need to identify the class that closely aligns with their model to make an informed decision regarding the appropriate development framework. The methodology is used to assess well-known ABMS parallel development frameworks (FLAME, RepastHPC, and DMASON) on real HPC platforms. The obtained results are validated using a real application for infection and contact tracing modeling.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Efficient Code Region Characterization Through Automatic Performance Counters Reduction Using Machine Learning Techniques

  • Harutyunyan Gevorgyan, Suren|||0000-0003-2224-5730
  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Sikora, Anna|||0000-0003-0090-4109
  • Filipovič, Jiří|||0000-0002-5703-9673
  • Dutta, Akash|||0009-0007-0947-1182
  • Jannesari, Ali|||0000-0001-8672-5317
  • Alcaraz, Jordi|||0000-0002-9640-6763
Leveraging hardware performance counters provides valuable insights into system resource utilization, aiding performance analysis and tuning for parallel applications. The available counters vary with architecture and are collected at execution time. Their abundance and the limited number of registers for measurement make gathering laborious and costly. Efficient characterization of parallel regions necessitates a dimension reduction strategy. While recent efforts have focused on manually reducing the number of counters for specific architectures, this paper introduces a novel approach: an automatic dimension reduction technique for efficiently characterizing parallel code regions across diverse architectures. The methodology is based on Machine Learning ensembles because of their precision and ability at capturing different relationships between the input features and the target variables. Evaluation results show that ensembles can successfully reduce the number of hardware performance counters that characterize a code region. We validate our approach on CPUs using a comprehensive dataset of OpenMP regions, showing that any region can be accurately characterized by 8 relevant hardware performance counters. In addition, we also apply the proposed methodology on GPUs using a reduced set of kernels, demonstrating its effectiveness across various hardware configurations and workloads.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Performance Optimization using Multimodal Modeling and Heterogeneous GNN

  • Dutta, Akash|||0009-0007-0947-1182
  • Alcaraz, Jordi|||0000-0002-9640-6763
  • Tehranijamsaz, Ali|||0009-0001-3678-5730
  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Sikora, Anna|||0000-0003-0090-4109
  • Jannesari, Ali|||0000-0001-8672-5317
Growing heterogeneity and configurability in HPC architectures has made auto-tuning applications and runtime parameters on these systems very complex. Users are presented with a multitude of options to configure parameters. In addition to application specific solutions, a common approach is to use general purpose search strategies, which often might not identify the best configurations or their time to convergence is a significant barrier. There is, thus, a need for a general purpose and efficient tuning approach that can be easily scaled and adapted to various tuning tasks. We propose a technique for tuning parallel code regions that is general enough to be adapted to multiple tasks. In this paper, we analyze IR-based programming models to make task-specific performance optimizations. To this end, we propose the Multimodal Graph Neural Network and Autoencoder (MGA) tuner, a multimodal deep learning based approach that adapts Heterogeneous Graph Neural Networks and Denoising Autoencoders for modeling IR-based code representations that serve as separate modalities. This approach is used as part of our pipeline to model a syntax, semantics, and structure-aware IR-based code representation for tuning parallel code regions/kernels. We extensively experiment on OpenMP and OpenCL code regions/kernels obtained from PolyBench, Rodinia, STREAM, DataRaceBench, AMD SDK, NPB, NVIDIA SDK, Parboil, SHOC, LULESH, XSBench, RSBench, miniFE, miniAMR, and Quicksilver benchmarks and applications. We apply our multimodal learning techniques to the tasks of (i) optimizing the number of threads, scheduling policy and chunk size in OpenMP loops and, (ii) identifying the best device for heterogeneous device mapping of OpenCL kernels. Our experiments show that this multimodal learning based approach outperforms the state-of-the-art in almost all experiments.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

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

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

Enhancing the realism of wildfire simulation using composite Bézier curves

  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
One of the consequences of climate change is the increase in forest fires around the world. In order to act quickly when this type of natural disaster occurs, it is important to have simulation tools that allow a better approximation of the evolution of the fire, especially in Wildland Urban Interface (WUI) areas. Most forest fire propagation simulators tend to represent the perimeter of the fire in a polygonal way, which often does not allow us to capture the real evolution of the fire in complex environments, both at the terrain and vegetation levels. In this work, we focus on Elliptical Wave Propagation (EWP) based simulators, which represent the perimeter of the fire with a set of points connected to each other by straight lines. When the perimeter grows and new points must be added, the interpolation method used is linear interpolation. This system generates unrealistic shapes of fires. In this work, an interpolation method leveraging Composite Bézier Curves (CBC) is proposed to generate fire evolution shapes in a more realistic way. The proposed method has been incorporated into FARSITE, a well-known EWP-based forest fire spread simulator. Both interpolation methods have been applied to ideal scenarios and a real case. The results show that the proposed interpolation method (CBC) is capable of generating more realistic fire shapes and, in addition, enables the simulator the ability to better simulate the spread of fire in WUI zones.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Enhancing high-resolution fuel maps in WUI areas, El Pont de Vilomara fire, a case study

  • Sánchez Gayet, Paula|||0009-0003-6372-716X
  • González Fernández, Irene|||0000-0001-8602-6495
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Carrillo, Carlos|||0000-0003-3606-7517
A precise understanding of the spatial distribution of fuels and buildings at high resolution is crucial for analysing, modelling, and predicting fire behaviour in Wildland-Urban Interface (WUI) areas. However, the challenging and costly nature of estimating and mapping forest fuel attributes presents obstacles to global efforts in creating high-resolution fuel maps. This work addresses these limitations by proposing a strategy to generate high-resolution fuel maps based on the 1 km resolution FirEUrisk fuel map and transforming it into an enriched 20 m resolution fuel map, incorporating constructions and water masks. For simulation purposes, the forest fire spread simulator FARSITE has been used. The proposed enhanced downscaling strategy has been tested on a forest fire that occurred in July 2022 in the village El Pont de Vilomara in Catalonia (north-east of Spain). This work highlights how detailed mapping can significantly improve the precision of forest fire simulations, especially in WUI areas. The higher resolution fuel map provides a more accurate representation of fire behavior (SC 0.8 vs. 0.7) while maintaining the same fire detection (POD) as the unchanged fuel map but significantly reducing false alarms (lower FAR). This improvement contributes to proactive fire prevention strategies and ensures an immediate and effective emergency response.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Impact of Mixed-Precision, A Way to Accelerate Data-Driven Forest Fire Spread Systems

  • Carrillo, Carlos|||0000-0003-3606-7517
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Cortés Fité, Ana|||0000-0003-1697-1293
Every year, forest fires burn thousands of hectares of forest around the world and cause significant damage to the economy and people from the affected zone. For that reason, computational fire spread models arise as useful tools to minimize the impact of wildfires. It is well known that part of the forest fire forecast error comes from the uncertainty in the input data required by the models. Different strategies have been developed to reduce the impact of this input-data uncertainty during the last few years. One of these strategies consists of introducing a data-driven calibration stage where the input parameters are adjusted according to the actual evolution of the fire using an evolutionary scheme. In particular, the approach described in this work consists of a Genetic Algorithm (GA). This calibration strategy is computationally intensive and time-consuming. In the case of natural hazards, it is necessary to maintain a balance between accuracy and time needed to calibrate the input parameters. Most scientific codes have over-engineered the numerical precision required to obtain reliable results. In this paper, we propose to use a mixed-precision methodology to accelerate the calibration of the input parameters involved in forest fire spread prediction without sacrificing the accuracy of the forecast. The proposed scheme has been tested on a real fire. The results have led us to conclude that using the mixed-precision approach does not compromise the quality of the result provided by the forest fire spread simulator and can also speed up the whole evolutionary prediction system.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

A new paradigm for forest fire spread prediction, Faster decisions at high resolution

  • González Fernández, Irene|||0000-0001-8602-6495
  • Carrillo, Carlos|||0000-0003-3606-7517
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Margalef, Tomàs|||0000-0001-6384-7389
Climate change has led to a significant increase in the number of wildfire events and their severity. To mitigate their impact, it is necessary to be able to make quick decisions according to the fire behavior. In order to assist on these decisions, we rely on forest fire spread simulators. However, one of the main problems associated to these tools lies in finding the appropriate balance between execution time and simulation resolution, which has a direct impact on the accuracy of the simulated results. Simulations at high resolution are computational intensive in terms of execution time and, therefore, they are not used for real-time evolution forecast. FARSITE forest fire spread simulator has arisen as the most recognized simulation tool based on the Elliptical Wave Propagation (EWP) scheme. However, its main drawback consists of high execution times due the perimeter reconstruction algorithm used. In this paper, we propose an alternative algorithm to perform the reconstruction process based on the α -shapealgorithm. The proposed algorithm, Boundary α -shape algorithm, has been design bearing in mind that it could be easily parallelized. The obtained results when executing FARSITE by exchanging its reconstruction algorithm by the new one highlights that the Boundary α -shape allows a notable execution time reduction.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Cloud-Based Urgent Computing for Forest Fire Spread Prediction under Data Uncertainties

  • Fraga, Edigley|||0000-0002-5525-6164
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Hernández Budé, Porfidio|||0000-0002-8592-934X
Forest fires severely affect many ecosystems every year, leading to large environmental damages, casualties, and economic losses. Emerging and established technologies are used to help wildfire analysts determine fire behavior and spread, aiming at more accurate prediction results and efficient use of resources in fire fighting. We propose a novel forest fire spread prediction platform based on a proven two-stage prediction model devised to deal with input data uncertainties. The model is able to calibrate the unknown parameters based on the real observed data using an iterative process. Since this calibration is compute-intensive and due to the unpredictability of urgent computing needs, we exploit an elastic and scalable cloud-based solution platform implemented through coarse-grain parallel processing using a work queue.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Efficient Cloud-Based Calibration of Input Data for Forest Fire Spread Prediction

  • Fraga, Edigley|||0000-0002-5525-6164
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Hernández Budé, Porfidio|||0000-0002-8592-934X
Every year, forest fires cause damages to biodiversity, atmosphere, and economy. To face such permanent threat, wildfire analysts rely on emerging and well established technologies to determine fire behavior and propagation patterns. Nevertheless, input data describing fire scenarios are subject to high levels of uncertainty that represent a serious challenge for the correctness of the prediction. The unknown parameters need to be adjusted, and an input data calibration phase is carried over following a genetic algorithm strategy. The calibrated input is then pipelined into the actual prediction phase. In addition, this two-stage prediction scheme is leveraged by the cloud computing, which enables high level of parallelism on demand, almost real-time elasticity and unlimited scalability. All of them at a low-cost strategy. In this paper, to obtain more accurate prediction results and efficient use of cloud resources in the compute-intensive calibration phase, we propose a new fitness function in tandem with a strict deadline policy that decreases overall processing time. In consonance with the hard-deadline-driven nature of fire extinction activities, the proposed strategies improve the genetic algorithm convergence and decrease the response time for the calibration stage, setting up an important upper bound limit to the critical compute-intensive adjustment phase. For the case study evaluated, only 3.87% of of accuracy loss is given out in exchange of a guarantee that the calibration phase will never last more than 50 minutes in the worst case.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Exploring the influence of land use on the urban carbonyl sulfide budget: a case study of the metropolitan area of Barcelona

  • Estruch, Carme
  • Belviso, Sauveur
  • Badia Moragas, Alba
  • Vidal Canedo, Veronica
  • Curcoll Masanes, Roger|||0000-0002-8025-673X
  • Udina Sistach, Mireia
  • Grossi, Claudia|||0000-0001-6678-4440
  • Morguí, Josep-Anton
  • Segura, Ricard
  • Ventura Caballé, Sergi
  • Sola Salvatierra, Yolanda
  • Villalba Mendez, Gara
Carbonyl sulfide (OCS) is used to quantify the carbon capture potential of the biosphere because of its direct correlation with CO2 uptake during photosynthesis. However, to constrain the urban biosphere signal, it is necessary to evaluate potential anthropogenic sources. We conducted two sampling campaigns in the Metropolitan Area of Barcelona (AMB), Spain, during May (full COVID lockdown) and October 2020 to measure the spatial distribution and variability of OCS in four urban land uses as follows: built, urban forest, urban park, and peri-urban agriculture. The OCS background levels determined at Tibidabo (442 m asl) were approximately 484 ± 20 ppt and 407 ± 8 ppt for May and October 2020, respectively, and agreed with other seasonal surveys conducted in Europe during that same period. Averaged emissions were in the range of +¿12 ± 40 ppt for the city and were +¿9.4 ± 40.9 ppt for urban +¿22.1 ± 48 ppt for urban green +¿20.7 ± 42.9 ppt for agricultural and -¿4.8 ± 19.6 ppt for forest. The urban values ranged from neutral to above background, suggesting nearby anthropogenic and marine emissions such as +¿150 ppt in Montjuic, which is downwind of Barcelona's harbor. During the crop-growing season in May, the agricultural areas consistently showed values below the background (up to -¿76 ppt in Gavà, uptake) at 7:00 UTC when the land breezes were dominant, while later in the morning, when the sea breeze are developed, the plant sink is masked by the transport of marine emissions. Urban forests located north of Tibidabo showed OCS values up to -¿70 ppt, suggesting significant uptake by urban forests. We conclude that determining the urban biosphere signal using OCS as a tracer is more complex than expected because the marine and anthropogenic emissions from the port strongly impact the spatial-temporal distribution of OCS., This work has been made possible thanks to the financial support of the European Research Council (ERC) Consolidator project: Integrated System Analysis of Urban Vegetation and Agriculture (818002-URBAG), the Spanish Ministry of Science, Innovation and Universities, through the “Maria de Maeztu” programme for Units of Excellence (CEX2019-000940-M), and the funding and recognition awarded to the research group Sostenipra (2021 SGR 00734) by the Department of Research and Universities of the Generalitat de Catalunya. This work also has been granted by the Spanish Ministry of Science and Innovation MCIN AEI/10.13039/501100011033 under contract PID2020-113614RB-C21, by the Spanish Government under Grant PRE2018-085425 and by the Catalan Government under contract 2021 SGR 00574. The authors acknowledge the computer resources at PICASSO and the technical support provided by the Universidad de Málaga (Grant RES-AECT-2020-2-0004).
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Accelerating edit-distance sequence alignment on GPU using the wavefront algorithm

  • Aguado Puig, Quim|||0000-0003-4871-3192
  • Marco Sola, Santiago|||0000-0001-7951-3914
  • Moure López, Juan Carlos
  • Castells Rufas, David
  • Álvarez Martí, Lluc|||0000-0003-0506-8867
  • Espinosa Morales, Antonio
  • Moretó Planas, Miquel|||0000-0002-9848-8758
Sequence alignment remains a fundamental problem with practical applications ranging from pattern recognition to computational biology. Traditional algorithms based on dynamic programming are hard to parallelize, require significant amounts of memory, and fail to scale for large inputs. This work presents eWFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute the exact edit-distance sequence alignment based on the wavefront alignment algorithm (WFA). This approach exploits the similarities between the input sequences to accelerate the alignment process while requiring less memory than other algorithms. Our implementation takes full advantage of the massive parallel capabilities of modern GPUs to accelerate the alignment process. In addition, we propose a succinct representation of the alignment data that successfully reduces the overall amount of memory required, allowing the exploitation of the fast shared memory of a GPU. Our results show that our GPU implementation outperforms by 3- 9× the baseline edit-distance WFA implementation running on a 20 core machine. As a result, eWFA-GPU is up to 265 times faster than state-of-the-art CPU implementation, and up to 56 times faster than state-of-the-art GPU implementations., This work was supported in part by the European Unions’s Horizon 2020 Framework Program through the DeepHealth Project under Grant 825111; in part by the European Union Regional Development Fund within the Framework of the European Regional Development Fund (ERDF) Operational Program of Catalonia 2014–2020 with a Grant of 50% of Total Cost Eligible through the Designing RISC-V-based Accelerators for next-generation Computers Project under Grant 001-P-001723; in part by the Ministerio de Ciencia e Innovacion (MCIN) Agencia Estatal de Investigación (AEI)/10.13039/501100011033 under Contract PID2020-113614RB-C21 and Contract TIN2015-65316-P; and in part by the Generalitat de Catalunya (GenCat)-Departament de Recerca i Universitats (DIUiE) (GRR) under Contract 2017-SGR-313, Contract 2017-SGR-1328, and Contract 2017-SGR-1414. The work of Miquel Moreto was supported in part by the Spanish Ministry of Economy, Industry and Competitiveness under Ramon y Cajal Fellowship under Grant RYC-2016-21104., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Optimized thread-block arrangement in a GPU implementation of a linear solver for atmospheric chemistry mechanisms

  • Guzmán Ruiz, Christian
  • Acosta Cobos, Mario César
  • Jorba Casellas, Oriol|||0000-0001-5872-0244
  • Cesar Galobardes, Eduardo
  • Dawson, Matthew
  • Oyarzun Altamirano, Guillermo|||0000-0001-9524-3782
  • García Pando, Carlos Pérez
  • Serradell Maronda, Kim|||0000-0001-8230-4347
Earth system models (ESM) demand significant hardware resources and energy consumption to solve atmospheric chemistry processes. Recent studies have shown improved performance from running these models on GPU accelerators. Nonetheless, there is room for improvement in exploiting even more GPU resources. This study proposes an optimized distribution of the chemical solver's computational load on the GPU, named Block-cells. Additionally, we evaluate different configurations for distributing the computational load in an NVIDIA GPU. We use the linear solver from the Chemistry Across Multiple Phases (CAMP) framework as our test bed. An intermediate-complexity chemical mechanism under typical atmospheric conditions is used. Results demonstrate a 35× speedup compared to the single-CPU thread reference case. Even using the full resources of the node (40 physical cores) on the reference case, the Block-cells version outperforms them by 50%. The Block-cells approach shows promise in alleviating the computational burden of chemical solvers on GPU architectures., This work was partially supported by funding from the Ministerio de Ciencia, Innovación y Universidades as part of the BROWNING project (RTI2018-099894-BI00 funded by MCIN AEI/10.13039/ 501100011033) and part of the CAROL project (PID2020-113614RBC21 funded by MCIN AEI/10.13039/501100011033), the Generalitat de Catalunya (2021-SGR-00574, 2021-SGR-01550 and 2021- SGR00785) and the AXA Research Fund through the AXA Chair on Sand and Dust Storms established at the Barcelona Supercomputing Center (BSC). Matthew Dawson has received funding from the European Union’s Horizon 2020 research and innovation program under Marie Sklodowska Curie grant agreement no. 747048. Mario Acosta has received funding from the National Research Agency through OEMES (PID2020-116324RA-I00). This paper expresses the opinions of the authors and not necessarily those of the funding commissions., Peer Reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Singletrack: an algorithm for improving memory consumption and performance of gap-affine sequence alignment

  • López-Villellas, Lorién
  • Iñiguez, Cristian
  • Jiménez-Blanco, Albert
  • Aguado-Puig, Quim
  • Moretó, Miquel
  • Alastruey-Benedé, Jesús
  • Ibáñez, Pablo
  • Marco-Sola, Santiago
Motivation Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy. Results We present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires storing a single DP matrix while preserving optimal alignment results. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e. 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. We demonstrate that Singletrack reduces memory consumption for both SK and WFA algorithms, lowering SK usage by 2× and 4× and WFA usage by 3× and 5× for gap-affine and dual gap-affine alignments, respectively. Moreover, replacing KSW2’s memory-reduction technique with Singletrack accelerates its SK implementation by up to 1.4× at the cost of doubling memory consumption, while Singletrack increases the performance of the WFA implementation in WFA2-lib by 1.2–2.1×. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2× higher performance.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Exploring the influence of land use on the urban carbonyl sulfide budget: a case study of the metropolitan area of Barcelona

  • Estruch, Carme
  • Belviso, Sauveur
  • Badia Moragas, Alba
  • Vidal Canedo, Veronica
  • Curcoll Masanes, Roger
  • Udina Sistach, Mireia
  • Grossi, Claudia
  • Morguí, Josep-Anton
  • Segura, Ricard
  • Ventura Caballé, Sergi
  • Sola Salvatierra, Yolanda
  • Villalba Mendez, Gara
Carbonyl sulfide (OCS) is used to quantify the carbon capture potential of the biosphere because of its direct correlation with CO2 uptake during photosynthesis. However, to constrain the urban biosphere signal, it is necessary to evaluate potential anthropogenic sources. We conducted two sampling campaigns in the Metropolitan Area of Barcelona (AMB), Spain, during May (full COVID lockdown) and October 2020 to measure the spatial distribution and variability of OCS in four urban land uses as follows: built, urban forest, urban park, and peri-urban agriculture. The OCS background levels determined at Tibidabo (442 m asl) were approximately 484 ± 20 ppt and 407 ± 8 ppt for May and October 2020, respectively, and agreed with other seasonal surveys conducted in Europe during that same period. Averaged emissions were in the range of +¿12 ± 40 ppt for the city and were +¿9.4 ± 40.9 ppt for urban +¿22.1 ± 48 ppt for urban green +¿20.7 ± 42.9 ppt for agricultural and -¿4.8 ± 19.6 ppt for forest. The urban values ranged from neutral to above background, suggesting nearby anthropogenic and marine emissions such as +¿150 ppt in Montjuic, which is downwind of Barcelona's harbor. During the crop-growing season in May, the agricultural areas consistently showed values below the background (up to -¿76 ppt in Gavà, uptake) at 7:00 UTC when the land breezes were dominant, while later in the morning, when the sea breeze are developed, the plant sink is masked by the transport of marine emissions. Urban forests located north of Tibidabo showed OCS values up to -¿70 ppt, suggesting significant uptake by urban forests. We conclude that determining the urban biosphere signal using OCS as a tracer is more complex than expected because the marine and anthropogenic emissions from the port strongly impact the spatial-temporal distribution of OCS., This work has been made possible thanks to the financial support of the European Research Council (ERC) Consolidator project: Integrated System Analysis of Urban Vegetation and Agriculture (818002-URBAG), the Spanish Ministry of Science, Innovation and Universities, through the “Maria de Maeztu” programme for Units of Excellence (CEX2019-000940-M), and the funding and recognition awarded to the research group Sostenipra (2021 SGR 00734) by the Department of Research and Universities of the Generalitat de Catalunya. This work also has been granted by the Spanish Ministry of Science and Innovation MCIN AEI/10.13039/501100011033 under contract PID2020-113614RB-C21, by the Spanish Government under Grant PRE2018-085425 and by the Catalan Government under contract 2021 SGR 00574. The authors acknowledge the computer resources at PICASSO and the technical support provided by the Universidad de Málaga (Grant RES-AECT-2020-2-0004)., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Accelerating edit-distance sequence alignment on GPU using the wavefront algorithm

  • Aguado Puig, Quim
  • Marco Sola, Santiago
  • Moure López, Juan Carlos
  • Castells Rufas, David
  • Álvarez Martí, Lluc
  • Espinosa Morales, Antonio
  • Moretó Planas, Miquel
Sequence alignment remains a fundamental problem with practical applications ranging from pattern recognition to computational biology. Traditional algorithms based on dynamic programming are hard to parallelize, require significant amounts of memory, and fail to scale for large inputs. This work presents eWFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute the exact edit-distance sequence alignment based on the wavefront alignment algorithm (WFA). This approach exploits the similarities between the input sequences to accelerate the alignment process while requiring less memory than other algorithms. Our implementation takes full advantage of the massive parallel capabilities of modern GPUs to accelerate the alignment process. In addition, we propose a succinct representation of the alignment data that successfully reduces the overall amount of memory required, allowing the exploitation of the fast shared memory of a GPU. Our results show that our GPU implementation outperforms by 3- 9× the baseline edit-distance WFA implementation running on a 20 core machine. As a result, eWFA-GPU is up to 265 times faster than state-of-the-art CPU implementation, and up to 56 times faster than state-of-the-art GPU implementations., This work was supported in part by the European Unions’s Horizon 2020 Framework Program through the DeepHealth Project under Grant 825111; in part by the European Union Regional Development Fund within the Framework of the European Regional Development Fund (ERDF) Operational Program of Catalonia 2014–2020 with a Grant of 50% of Total Cost Eligible through the Designing RISC-V-based Accelerators for next-generation Computers Project under Grant 001-P-001723; in part by the Ministerio de Ciencia e Innovacion (MCIN) Agencia Estatal de Investigación (AEI)/10.13039/501100011033 under Contract PID2020-113614RB-C21 and Contract TIN2015-65316-P; and in part by the Generalitat de Catalunya (GenCat)-Departament de Recerca i Universitats (DIUiE) (GRR) under Contract 2017-SGR-313, Contract 2017-SGR-1328, and Contract 2017-SGR-1414. The work of Miquel Moreto was supported in part by the Spanish Ministry of Economy, Industry and Competitiveness under Ramon y Cajal Fellowship under Grant RYC-2016-21104., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Optimized thread-block arrangement in a GPU implementation of a linear solver for atmospheric chemistry mechanisms

  • Guzmán Ruiz, Christian
  • Acosta Cobos, Mario César
  • Jorba Casellas, Oriol
  • Cesar Galobardes, Eduardo
  • Dawson, Matthew
  • Oyarzun Altamirano, Guillermo
  • García Pando, Carlos Pérez
  • Serradell Maronda, Kim
Earth system models (ESM) demand significant hardware resources and energy consumption to solve atmospheric chemistry processes. Recent studies have shown improved performance from running these models on GPU accelerators. Nonetheless, there is room for improvement in exploiting even more GPU resources. This study proposes an optimized distribution of the chemical solver's computational load on the GPU, named Block-cells. Additionally, we evaluate different configurations for distributing the computational load in an NVIDIA GPU. We use the linear solver from the Chemistry Across Multiple Phases (CAMP) framework as our test bed. An intermediate-complexity chemical mechanism under typical atmospheric conditions is used. Results demonstrate a 35× speedup compared to the single-CPU thread reference case. Even using the full resources of the node (40 physical cores) on the reference case, the Block-cells version outperforms them by 50%. The Block-cells approach shows promise in alleviating the computational burden of chemical solvers on GPU architectures., This work was partially supported by funding from the Ministerio de Ciencia, Innovación y Universidades as part of the BROWNING project (RTI2018-099894-BI00 funded by MCIN AEI/10.13039/ 501100011033) and part of the CAROL project (PID2020-113614RBC21 funded by MCIN AEI/10.13039/501100011033), the Generalitat de Catalunya (2021-SGR-00574, 2021-SGR-01550 and 2021- SGR00785) and the AXA Research Fund through the AXA Chair on Sand and Dust Storms established at the Barcelona Supercomputing Center (BSC). Matthew Dawson has received funding from the European Union’s Horizon 2020 research and innovation program under Marie Sklodowska Curie grant agreement no. 747048. Mario Acosta has received funding from the National Research Agency through OEMES (PID2020-116324RA-I00). This paper expresses the opinions of the authors and not necessarily those of the funding commissions., Peer Reviewed, Postprint (author's final draft)
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Predicting number of threads using balanced datasets for openMP regions

  • Alcaraz, Jordi|||0000-0002-9640-6763
  • TehraniJamsaz, Ali
  • Dutta, Akash|||0009-0007-0947-1182
  • Sikora, Anna|||0000-0003-0090-4109
  • Jannesari, Ali|||0000-0001-8672-5317
  • Sorribes Gomis, Joan|||0000-0002-8868-7382
  • César Galobardes, Eduardo|||0000-0002-9729-8557
Incorporating machine learning into automatic performance analysis and tuning tools is a promising path to tackle the increasing heterogeneity of current HPC applications. However, this introduces the need for generating balanced datasets of parallel applications' executions and for dealing with natural imbalances for optimizing performance parameters. This work proposes a holistic approach that integrates a methodology for building balanced datasets of OpenMP code-region patterns and a way to use such datasets for tuning performance parameters. The methodology uses hardware performance counters to characterize the execution of a given region and correlation analysis to determine whether it covers an unique part of the pattern input space. Nevertheless, a balanced dataset of region patterns may become naturally imbalanced when used for training a model for tuning any specific performance parameter. For this reason, we have explored several methods for dealing with naturally imbalanced datasets for finding the appropriated way of using them for tuning purposes. Experimentation shows that the proposed methodology can be used to build balanced datasets and that such datasets, plus a combination of Random Forest and binary classification, can be used to train a model able to accurately tune the number of threads of OpenMP parallel regions.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Drastic reduction of false positive species in samples of insects by intersecting the default output of two popular metagenomic classifiers

  • Garrido-Sanz, Lidia|||0000-0003-2622-9674
  • Senar Rosell, Miquel|||0000-0002-0316-5420
  • Piñol, Josep|||0000-0002-4067-3301
The use of high-throughput sequencing to recover short DNA reads of many species has been widely applied on biodiversity studies, either as amplicon metabarcoding or shotgun metagenomics. These reads are assigned to taxa using classifiers. However, for different reasons, the results often contain many false positives. Here we focus on the reduction of false positive species attributable to the classifiers. We benchmarked two popular classifiers, BLASTn followed by MEGAN6 (BM) and Kraken2 (K2), to analyse shotgun sequenced artificial single-species samples of insects. To reduce the number of misclassified reads, we combined the output of the two classifiers in two different ways: (1) by keeping only the reads that were attributed to the same species by both classifiers (intersection approach); and (2) by keeping the reads assigned to some species by any classifier (union approach). In addition, we applied an analytical detection limit to further reduce the number of false positives species. As expected, both metagenomic classifiers used with default parameters generated an unacceptably high number of misidentified species (tens with BM, hundreds with K2). The false positive species were not necessarily phylogenetically close, as some of them belonged to different orders of insects. The union approach failed to reduce the number of false positives, but the intersection approach got rid of most of them. The addition of an analytic detection limit of 0.001 further reduced the number to ca. 0.5 false positive species per sample. The misidentification of species by most classifiers hampers the confidence of the DNA-based methods for assessing the biodiversity of biological samples. Our approach to alleviate the problem is straightforward and significantly reduced the number of reported false positive species.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Optimal gap-affine alignment in O (s) space

  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Eizenga, Jordan|||0000-0001-8345-8356
  • Guarracino, Andrea|||0000-0001-9744-131X
  • Paten, Benedict|||0000-0001-8863-3539
  • Garrison, Erik|||0000-0003-3821-631X
  • Moreto, Miquel|||0000-0002-9848-8758
Pairwise sequence alignment remains a fundamental problem in computational biology and bioinformatics. Recent advances in genomics and sequencing technologies demand faster and scalable algorithms that can cope with the ever-increasing sequence lengths. Classical pairwise alignment algorithms based on dynamic programming are strongly limited by quadratic requirements in time and memory. The recently proposed wavefront alignment algorithm (WFA) introduced an efficient algorithm to perform exact gap-affine alignment in time, where s is the optimal score and n is the sequence length. Notwithstanding these bounds, WFA's memory requirements become computationally impractical for genome-scale alignments, leading to a need for further improvement. In this article, we present the bidirectional WFA algorithm, the first gap-affine algorithm capable of computing optimal alignments in memory while retaining WFA's time complexity of . As a result, this work improves the lowest known memory bound to compute gap-affine alignments. In practice, our implementation never requires more than a few hundred MBs aligning noisy Oxford Nanopore Technologies reads up to 1 Mbp long while maintaining competitive execution times. All code is publicly available at . Supplementary data are available at Bioinformatics online.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Exploring the influence of land use on the urban carbonyl sulfide budget, a case study of the Metropolitan Area of Barcelona

  • Estruch, Carme|||0000-0002-9390-2016
  • Belviso, Sauveur|||0000-0001-8539-5133
  • Badia, Alba|||0000-0003-0906-8258
  • Vidal, Verònica|||0000-0002-5235-0112
  • Curcoll Masanes, Roger|||0000-0002-8025-673X
  • Udina, Mireia|||0000-0002-8024-3293
  • Grossi, Claudia|||0000-0001-6678-4440
  • Morguí, Josep-Anton|||0000-0002-3184-0067
  • Segura Barrero, Ricard|||0000-0003-1048-1875
  • Ventura, Sergi|||0000-0003-2529-209X
  • Sola, Yolanda|||0000-0002-8693-9152
  • Villalba, Gara|||0000-0001-6392-0902
Carbonyl sulfide (OCS) is used to quantify the carbon capture potential of the biosphere because of its direct correlation with CO2 uptake during photosynthesis. However, to constrain the urban biosphere signal, it is necessary to evaluate potential anthropogenic sources. We conducted two sampling campaigns in the Metropolitan Area of Barcelona (AMB), Spain, during May (full COVID lockdown) and October 2020 to measure the spatial distribution and variability of OCS in four urban land uses as follows: built, urban forest, urban park, and peri-urban agriculture. The OCS background levels determined at Tibidabo (442 m asl) were approximately 484 ± 20 ppt and 407 ± 8 ppt for May and October 2020, respectively, and agreed with other seasonal surveys conducted in Europe during that same period. Averaged emissions were in the range of +Δ12 ± 40 ppt for the city and were +Δ9.4 ± 40.9 ppt for urban +Δ22.1 ± 48 ppt for urban green +Δ20.7 ± 42.9 ppt for agricultural and -Δ4.8 ± 19.6 ppt for forest. The urban values ranged from neutral to above background, suggesting nearby anthropogenic and marine emissions such as +Δ150 ppt in Montjuic, which is downwind of Barcelona's harbor. During the crop-growing season in May, the agricultural areas consistently showed values below the background (up to -Δ76 ppt in Gavà, uptake) at 7:00 UTC when the land breezes were dominant, while later in the morning, when the sea breeze are developed, the plant sink is masked by the transport of marine emissions. Urban forests located north of Tibidabo showed OCS values up to -Δ70 ppt, suggesting significant uptake by urban forests. We conclude that determining the urban biosphere signal using OCS as a tracer is more complex than expected because the marine and anthropogenic emissions from the port strongly impact the spatial-temporal distribution of OCS.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Modeling air quality at urban scale in the city of Barcelona, A matter of green resolution

  • Vidal, Verònica|||0000-0002-5235-0112
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Badia, Alba|||0000-0003-0906-8258
  • Villalba, Gara|||0000-0001-6392-0902
Improvement of the air quality in highly polluted cities is a challenge for today's society. Many of the strategies that have been proposed for this purpose promote the creation of green infrastructures. The Weather Research and Forecasting model coupled with chemistry (WRF-Chem) is used to analyze the behavior of the most common pollutants and how they are dispersed as a result of different meteorological conditions. To also consider the impact of including green infrastructures on urban morphology, the BEP/BEM (Building Effect Parameterization/Building Energy Model) multi-layer urban scheme is also included in the system. Using the city of Barcelona as a case study, this paper confirms that the modeling methodology used up to now needs to be reviewed for the design of green cities. Certain limitations of the WRF-Chem+BEP/BEM coupled model when applied in urban resolution are discussed, as well as the reasons for such limitations, being the main contribution of this paper to show that an alternative paradigm such as Machine Learning techniques should be considered to address this challenge.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Optimized thread-block arrangement in a GPU implementation of a linear solver for atmospheric chemistry mechanisms

  • Guzman Ruiz, Christian|||0000-0003-3709-6483
  • Acosta, Mario C.|||0000-0001-7054-8168
  • Jorba, Oriol|||0000-0001-5872-0244
  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Dawson, Matthew
  • Oyarzun, Guillermo
  • Pérez García-Pando, Carlos|||0000-0002-4456-0697
  • Serradell, Kim|||0000-0001-8230-4347
Earth system models (ESM) demand significant hardware resources and energy consumption to solve atmospheric chemistry processes. Recent studies have shown improved performance from running these models on GPU accelerators. Nonetheless, there is room for improvement in exploiting even more GPU resources. This study proposes an optimized distribution of the chemical solver's computational load on the GPU, named Block-cells. Additionally, we evaluate different configurations for distributing the computational load in an NVIDIA GPU. We use the linear solver from the Chemistry Across Multiple Phases (CAMP) framework as our test bed. An intermediate-complexity chemical mechanism under typical atmospheric conditions is used. Results demonstrate a 35x speedup compared to the single-CPU thread reference case. Even using the full resources of the node (40 physical cores) on the reference case, the Block-cells version outperforms them by 50%. The Block-cells approach shows promise in alleviating the computational burden of chemical solvers on GPU architectures.