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): 9
Encontrada(s) 1 página(s)

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 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)

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 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 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.