基于GPU的大规模栅格数据分块并行处理方法  

Parallel Processing Method for Large Scale Raster Data Blocking Based on GPU

作　　者：崔树林[1,2] 张旭[2] 张树清[3] 张军[1] 

机构地区：[1]中山大学信息科学与技术学院,广东广州510006 [2]吉林大学珠海学院,广东珠海519041 [3]中国科学院东北地理与农业生态研究所,吉林长春130012

出　　处：《计算机技术与发展》2015年第3期19-22,共4页Computer Technology and Development

基　　金：中国科学院重点部署项目(KZZD-EW-07;KZZD-EW-07-02);国家自然科学基金(面上项目)(41271196)

摘　　要：数学形态学运算是栅格数据处理的重要方法,具有较高的计算复杂度、并行度等特点,较容易发挥GPU众核高度并行执行的优势,以提高其计算效率。然而,有限的GPU全局存储器限制了其在大规模数据中的应用。文中在分析现有栅格数据并行方法的基础上,基于通用并行计算架构CUDA,设计一种适应大规模数据的分块处理方法。文中以经典的膨胀算法为例对分块处理方法进行测试。实验结果表明:与传统的CPU串行处理方法相比,该方法可以显著提高数据处理速度。Mathematical morphology operations are important methods in the field of raster data processing,with high degree of computational complexity and parallelism. GPU-based hypercore parallel computing method can significantly improve the calculation speed.However,GPU＇s global memory limits its application in large scale data. Present a block-based method for large scale data,based on a general purpose parallel computing architecture,after analyzing the present parallel method for raster data. The new method is specifically tested with the classical dilation algorithm. Experimental results show that the calculation speed of the new method is faster than that of traditional sequence algorithm based on CPU.

关 键 词：GPU 分块 膨胀 栅格数据 

分 类 号：P208[天文地球—地图制图学与地理信息工程]