Accelerating wildfire susceptibility mapping through GPGPU

• We illustrate several GPGPU strategies for building Burn Probability Maps.
• Using three recent GPUs, we discuss an application example on a real area.
• We show how GPGPU allows to map the wildfire hazard level in low computing time.
• Some of the proposed approaches achieved a significant parallel speedup.

In the field of wildfire risk management the so-called burn probability maps (BPMs) are increasingly used with the aim of estimating the probability of each point of a landscape to be burned under certain environmental conditions. Such BPMs are usually computed through the explicit simulation of thousands of fires using fast and accurate models. However, even adopting the most optimized algorithms, the building of simulation-based BPMs for large areas results in a highly intensive computational process that makes mandatory the use of high performance computing. In this paper, General-Purpose Computation with Graphics Processing Units (GPGPU) is applied, in conjunction with a wildfire simulation model based on the Cellular Automata approach, to the process of BPM building. Using three different GPGPU devices, the paper illustrates several implementation strategies to speedup the overall mapping process and discusses some numerical results obtained on a real landscape.