Parallel optimization methods for raster data processing algorithms of neighborhood-scope
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    As parallel computing has become mature and practical, data intensive raster data processing algorithms are desiderating parallel computing technologies to reduce the running time. The objectives of this research focuses on the parallelization of neighborhood-scope algorithms. the sequential/parallel temporal model was developed, the affecting factors of each component of the temporal model were analyzed, and two optimization methods were proposed, which can further promote the parallel performance of neighborhood-scope algorithms: the Parallel I/O method that can reduce the data I/O cost; and the Halo Prediction method that can reduce the data communication cost. Experiments verified the effectiveness and efficiency of the proposed optimization methods, which can further promote the parallel performance by making the parallel algorithmic program fully take advantage of parallel computing resources.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 01,2011
  • Revised:
  • Adopted:
  • Online: September 12,2012
  • Published:
Article QR Code