A load-balancing strategy for data domain decomposition in parallel programming libraries of raster-based geocomputation
Yujing Wang, Bei-Bei Ai, Cheng‐Zhi Qin, A‐Xing Zhu
Abstract
Parallel programming libraries have been proposed to simplify programming for parallel raster-based geocomputation through hiding parallel programming details for users. However, the strategy of data domain decomposition used in existing libraries often leads to load imbalance owing to inherent characteristics of geocomputation including not only irregular spatial data distribution, but also spatial variation in the amount of computation, thereby impeding their parallel performances. This paper thus proposes a load-balancing strategy of data domain decomposition in parallel programming libraries for raster-based geocomputation based on the concept of spatial computational domain, which characterizes the distribution of computational intensity based on geocomputation characteristics. By implementing the proposed strategy with the message passing interface (MPI), a set of parallel raster-based geocomputation operators across different parallel computing platforms (known as PaRGO V2) was upgraded to improve load-balancing parallelization. The proposed strategy was evaluated by parallelizing two typical geocomputation algorithms (i.e. inverse distance weight interpolation and fuzzy c-means clustering) using PaRGO V2 with uneven distributed computational intensity. The results show that the proposed strategy with PaRGO V2, compared with the previously adopted data domain decomposition strategy, yielded significant improvements to the load balance (i.e. better parallel performance).