A quadtree approach to domain decomposition for spatial interpolation in grid computing environments

  • Authors:

  • Shaowen Wang;Marc P. Armstrong

  • Affiliations:

  • Academic Technologies-Research Services Division of Information Technology Services and Department of Geography, 128G South Lindquist, The University of Iowa, Iowa City, IA;Department of Geography and Program in Applied Mathematical and Computational Sciences, 316 Jessup Hall, The University of Iowa, Iowa City, IA

  • Venue:
  • Parallel Computing - Special issue: High performance computing with geographical data
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spatial interpolation is widely used in geographical information systems to create continuous surfaces from discrete data points. The creation of such surfaces, however, can involve considerable computation, especially when large problems are addressed, because of the need to search for neighbors on which to base interpolation calculations. Computational Grids provide the computing resources to tackle spatial interpolation in a timely way. The objective of this paper is to investigate the use of domain decomposition for a distributed inverse-distance-weighted spatial interpolation algorithm; the algorithm runs using the Globus Toolkit (GT) in a heterogeneous Grid computing environment. The interpolation algorithm is modified for implementation in the Grid by using a quadtree to spatially index and adaptively decompose the interpolation problem to balance processing loads. In addition, the GT allows the distributed algorithm to couple multiple machines, potentially of different architectures, to dynamically schedule the decomposed sub-problems through Globus services and protocols (e.g., resource management, data transfer). Experiments are conducted to test how well this distributed IDW interpolation algorithm scales to heterogeneous grid computing environments using irregularly distributed geographical data sets.