Explorations of the implementation of a parallel IDW interpolation algorithm in a Linux cluster-based parallel GIS

  • Authors:
  • Fang Huang;Dingsheng Liu;Xicheng Tan;Jian Wang;Yunping Chen;Binbin He

  • Affiliations:
  • Institute of Geo-Spatial Information Technology, College of Automation, University of Electronic Science and Technology of China, 2006 Xiyuan Road, Chengdu 611731, China;Center for Earth Observation and Digital Earth, Chinese Academy of Sciences, 45 Beisanhuan Xi Road, Beijing 100086, China;International School of Software, Wuhan University, 129 Luoyu Road, Wuhan 430079, China;Center for Earth Observation and Digital Earth, Chinese Academy of Sciences, 45 Beisanhuan Xi Road, Beijing 100086, China;Institute of Geo-Spatial Information Technology, College of Automation, University of Electronic Science and Technology of China, 2006 Xiyuan Road, Chengdu 611731, China;Institute of Geo-Spatial Information Technology, College of Automation, University of Electronic Science and Technology of China, 2006 Xiyuan Road, Chengdu 611731, China

  • Venue:
  • Computers & Geosciences
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.