Abstract

Geospatial cellular automata (Geo-CA) models have encountered challenges in computing efficiency and scalability when conducting large-scale land use change simulation applications. Parallel computing has proven to be effective to address these challenges. However, parallelization strategies for existing parallel Geo-CA models are always optimized for specific models and lack applicability to others. Besides, most parallel Geo-CA models focus on parallelizing land use change simulations, ignoring land use transition rule mining. Moreover, there is a lack of effective parallel strategies for demand-constrained land use change simulation on distributed heterogeneous architectures. This study proposes a parallel framework on hybrid parallel computing architectures applicable for raster-based Geo-CA models to enhance their computing efficiency and scalability while maintaining simulation accuracy. The framework provides parallelization strategies for both the land use transition rule mining for multiple land use types and the demand-constrained land use change simulation on distributed heterogeneous architectures. The framework was employed to parallelize two contemporary Geo-CA models, i.e., PLUS and MCCA. Experiments showed that the parallelized models achieved significant improvements in computing efficiency and scalability, confirming the effectiveness of the proposed framework for large-scale land use change simulation studies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.