Dynamic Load Balancing Based on Hypergraph Partitioning for Parallel Geospatial Cellular Automata Models

Parallel computing techniques have been adopted in geospatial cellular automata (CA) models to improve computational efficiency, enabling large-scale complex simulations of land use and land cover (LULC) changes at fine scales. However, the spatial distribution of computational intensity often changes along with the spatiotemporal dynamics of LULC during the simulation, leading to an increase in load imbalance among computing units and degradation of the computational performance of a parallel CA. This paper presents a dynamic load balancing method based on hypergraph partitioning for multi-process parallel geospatial CA models. During the simulation, the sub-domains are dynamically reassigned to computing processes through hypergraph partitioning according to the spatial variation in computational workloads to restore load balance. In addition, a novel mechanism called Migrated-SubCellspaces-First (MSCF) is proposed to reduce the cost of workload migration by employing a non-blocking communication technique to further improve computational performance. To demonstrate and evaluate the effectiveness of our method, a parallel geospatial CA model with hypergraph-based dynamic load balancing is developed. Experiments using a dataset from California showed that the proposed dynamic load balancing method achieved a computational performance enhancement of 62.59% by using 16 processes compared with a parallel CA with static load balancing.