Introduction to parallel programming
Introduction to parallel programming
Introduction to Parallel Computing
Introduction to Parallel Computing
A Parallel Intersection Algorithm for Vector Polygon Overlay
IEEE Computer Graphics and Applications
Load Balancing in High Performance GIS: Declustering Polygonal Maps
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Research On Cluster-Based Parallel GIS with the Example of Parallelization on GRASS GIS
GCC '07 Proceedings of the Sixth International Conference on Grid and Cooperative Computing
Study on Implementation of High-Performance GIServices in Spatial Information Grid
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Reduced Inverse Distance Weighting Interpolation for Painterly Rendering
CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
Preliminary through-out research on parallel-based remote sensing image processing
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Pollution models and inverse distance weighting: Some critical remarks
Computers & Geosciences
Accelerating universal Kriging interpolation algorithm using CUDA-enabled GPU
Computers & Geosciences
Hi-index | 0.00 |
To design and implement an open-source parallel GIS (OP-GIS) based on a Linux cluster, the parallel inverse distance weighting (IDW) interpolation algorithm has been chosen as an example to explore the working model and the principle of algorithm parallel pattern (APP), one of the parallelization patterns for OP-GIS. Based on an analysis of the serial IDW interpolation algorithm of GRASS GIS, this paper has proposed and designed a specific parallel IDW interpolation algorithm, incorporating both single process, multiple data (SPMD) and master/slave (M/S) programming modes. The main steps of the parallel IDW interpolation algorithm are: (1) the master node packages the related information, and then broadcasts it to the slave nodes; (2) each node calculates its assigned data extent along one row using the serial algorithm; (3) the master node gathers the data from all nodes; and (4) iterations continue until all rows have been processed, after which the results are outputted. According to the experiments performed in the course of this work, the parallel IDW interpolation algorithm can attain an efficiency greater than 0.93 compared with similar algorithms, which indicates that the parallel algorithm can greatly reduce processing time and maximize speed and performance.