English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This article focuses on a cluster-based parallel and distributed approach for large raster datasets in the context of Spatial Multicriteria Decision Analysis (S-MCDA). The research addresses a land-prioritization model with respect to conservation practices. The reliability of the model results is examined using a variance-based Spatially-Explicit Uncertainty and Sensitivity (SEUSA) framework. The original case study area to which we applied the model was located in southwest Michigan, USA, and incorporated millions of mapping units (pixels). As part of the model sensitivity analysis, several thousand intermediate raster datasets representing suitability surfaces are generated by means of a Monte Carlo Simulation (MCS). The creation of the suitability surfaces represents the most timeconsuming and memory-intensive step within the SEUSA framework. Sequential computational approaches to implementing SEUSA often have to accept a compromise with respect to problem size and the number of simulations, resulting in the low quality of the model sensitivity measures. This article presents the concept and implementation of a distributed and parallel solution based on the Python-Dask framework in order to improve the quality of SEUSA results for computationally-intensive spatial models.

Parallel and Distributed Computing for large raster-based Spatial Multicriteria Decision Analysis Problems: A Computational Performance Comparison