Pasar al contenido principal

Resultados relacionados

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

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 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 Capítulo o parte de un libro (BookPart)

Assessing Physics Parameterizations Using Evolutionary Computation

  • Guerrero Calzas, Iciar
  • Rossetto, Lorenzo
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Hanzich, Mauricio|||0000-0003-4460-1118
  • Miró, Josep Ramon|||0000-0003-2838-6083
Hailstorms are intense, localized weather phenomena that can severely impact agriculture, infrastructure, and property, making precise forecasting essential for risk management. The Weather Research and Forecasting (WRF) model is widely used for numerical weather prediction, offering numerous physical parameterization options to represent atmospheric processes. However, due to the large number of possible configurations, identifying the most suitable configuration is a challenge. This research uses a genetic algorithm (GA) to systematically refine WRF physics schemes for hail prediction in Central Europe, specifically for the hail events of June 2022. Within this framework, WRF configurations are treated as individuals in a population that evolves through selection, crossover, and mutation over multiple iterations. Fitness is evaluated using the F2 score. This methodology allows to evaluate more than 2.4 million possible setups improving the WRF model's capacity to accurately represent hailstorms. This strategy provides a robust framework for testing a wide range of setups, proving its value in refining parameterizations to better forecast impactful weather phenomena.
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)

Transferability of UNet-Based Downscaling Model for High-Resolution Temperature Data Across Diverse Regions

  • Benitez Benavides, Marc
  • Rodriguez, Mirta
  • Panadero, Javier|||0000-0002-3793-3328
  • Dutta, Omjyoti
  • Margalef, Tomàs|||0000-0001-6384-7389
High-resolution atmospheric data is essential for understanding local atmospheric processes, however it is computationally expensive to achieve such high resolutions through physical models. Recently, deep learning techniques, particularly those used in Single Image Super-Resolution, have emerged as a promising approach for statistical downscaling. However, much of the existing research has focused on enhancing model performance within small geographical regions, with limited attention given to the transferability of these models to diverse areas outside of their training domain. This paper introduces a methodology that evaluates the ability of a UNet model to downscale daily 2-meter temperature data outside its training region. The proposed approach uses one-third of the Contiguous United States to train the model, and assesses its performance on unseen areas. Our experimental design deliberately tests both spatial and temporal generalization, demonstrating that relatively compact models can effectively transfer downscaling capabilities to new regions. This results in improvements across key performance metrics including Mean Absolute Error, Root Mean Square Error, and Peak Signal-to-Noise Ratio. Additionally, our approach significantly reduces computational costs while improving downscaling accuracy across diverse climatic and topographic conditions.
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 Artículo científico (JournalArticle)

Automatic tuning based on hardware performance counters and machine learning

  • 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
  • Alcaraz, Jordi|||0000-0002-9640-6763
This paper presents a Machine Learning (ML) methodology for automatically tuning parallel applications in heterogeneous High Performance Computing (HPC) environments using Hardware Performance Counters (HwPCs). The methodology addresses three critical challenges: counter quantity versus accessibility tradeoff, data interpretation complexity, and dynamic optimization needs. The introduced ensemble-based methodology automatically identifies minimal yet informative HwPC sets for code region identification and tuning parameter optimization. Experimental validation demonstrates high accuracy in predicting optimal thread allocation ( > 0.90 K-fold accuracy) and thread affinity ( > 0.95 accuracy) while requiring only 4-6 HwPCs. Compared to search-based methods like OpenTuner, the methodology achieves competitive performance with dramatically reduced optimization time. The architecture-agnostic design enables consistent performance across CPU and GPU platforms. These results establish a foundation for efficient, portable, automatic, and scalable tuning of parallel applications.
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.