© 2016, The Author(s). Wind field calculation is a critical issue in reaching accurate forest fire propagation predictions. However, when the involved terrain map is large, the amount of memory and the execution time can prevent them from being useful in an operational environment. Wind field calculation involves sparse matrices that are usually stored in CSR storage format. This storage format can cause sparse matrix-vector multiplications to create a bottleneck due to the number of cache misses involved. Moreover, the matrices involved are extremely sparse and follow a very well-defined pattern. Therefore, a new storage system has been designed to reduce memory requirements and cache misses in this particular sparse matrix-vector multiplication. Sparse matrix-vector multiplication has been implemented using this new storage format and taking advantage of the inherent parallelism of the operation. The new method has been implemented in OpenMP, MPI and CUDA and has been tested on different hardware configurations. The results are very promising and the execution time and memory requirements are significantly reduced.
|Journal||Journal of Supercomputing|
|Publication status||Published - 1 Jan 2017|
- Forest fire
- Preconditioned conjugate gradient
- Sparse matrix
- Wind field
Sanjuan, G., Tena, C., Margalef, T., & Cortés, A. (2017). Applying vectorization of diagonal sparse matrix to accelerate wind field calculation. Journal of Supercomputing, 73(1), 240-258. https://doi.org/10.1007/s11227-016-1696-9