基于CUDA的IDW并行算法及其实验分析
Parallel IDW Algorithm Based on CUDA and Experimental Analysis
查看参考文献11篇
|
文摘
|
近些年来, 空间数据获取技术得到了迅猛的提高, 例如LIDAR, 通常可以产生成千上万个点, 这对计算机的处理能力提出了挑战。最近, 图形处理器(GPU)的计算能力得到了巨大的提升, 致使GPU的通用计算引起了关注。GPU是流处理器的集合, 最近的设备的流处理器超过240个, 浮点峰值比CPU快10多倍。在GPU上编程和编译的环境称计算统一设备架构(CUDA), 它提供了可以简单生成并行代码的途径。基于CUDA的并行计算, 在很多领域得到了应用, 但是在空间插值方面应用较少。反距离权插值(IDW)算法, 因容易计算, 在空间插值中经常被使用。然而, 当维数增加时, 提升计算时间是紧要的, 故本文提出CUDA的IDW并行算法。并在相同的条件下, 对比CUDA和CPU的算法的运行时间, 数值实验表明, CUDA算法的运行速度是CPU算法的6倍左右。 |
|
其他语种文摘
|
In recent years, spatial data acquisition methods were significantly improved, such as LiDAR, which usually generated hundreds of millions of points. These amounts of datasets create great challenges to computation capacity of computers. In the past several years, the computing capacity of graphical processing unit(GPU) has improved significantly, too. General-purpose computing on GPUs has come into notice. GPUs are an aggregation of streaming processors. The amount of streaming processors in latest device exceeds 240. The peak floating-point operations per second of CPUs are ten times slower than that of GPUs now. A new software platform, called Computer Unified Device Architecture(CUDA), allows GPU programs to be developed in ANSI C. Parallel parts are worked on GPUs based on kernels, which are invoked by the CPU. Each kernel works on a grid of blocks, and each block is an array of threads. In the application process, each block is mapped to a multiprocessor, and each thread is mapped to a streaming processor. A typical CUDA program follows the flows as follow. First, the host function begins by locating one or more buffers in the GPU global memory and conveys the data to them. Then the CUDA program is started more times by appointing the number of threads per block. Finally, the results are transformed back to CPU memory. GPUs have been applied to solve many problems in signal processing, computational geometry and so forth. However, little has been used in spatial interpolation. CUDA Inverse-distance weighting(IDW) algorithm is the most frequently used model in spatial interpolation because it is relatively easy to compute. However, when dimensions increase, obtaining fast running time remains important. In this study, we explore the parallel algorithm for IDW, using the CUDA developed by NVIDIA. The main objective is to compare running times using CPUs versus GPUs under the same conditions. The numerical experiments show that processing speed of CUDA-based algorithm is 6times faster than that of CPU-based method. |
|
来源
|
地球信息科学学报
,2011,13(5):707-710 【核心库】
|
|
关键词
|
IDW
;
并行算法
;
CUDA
;
CPU
|
|
地址
|
（徐州）中国矿业大学环境与测绘学院, 徐州, 221116
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1560-8999 |
|
学科
|
自动化技术、计算机技术 |
|
基金
|
国家自然科学基金项目
|
|
文献收藏号
|
CSCD:4344897
|
参考文献 共
11
共1页
|
|
1.
Lu G Y. An Adaptive Inverse-distance Weighting Spatial Interpolation Technique.
Computer&Geoscience,2008,34:1044-1055
|
被引
62
次
|
|
|
|
|
2.
Ortega L. Parallel Drainage Network Computation on CUDA.
Computer &Geoscience,2010,36:171-178
|
被引
14
次
|
|
|
|
|
3.
肖汉. 基于GPGPU的并行影像匹配算法.
测绘学报,2010,39(1):46-51
|
被引
27
次
|
|
|
|
|
4.
张舒.
GPU高性能运算之CUDA,2009
|
被引
111
次
|
|
|
|
|
5.
赵元. 并行蚁群算法及其在区位选址中的应用.
测绘学报,2010,39(3):322-327
|
被引
9
次
|
|
|
|
|
6.
Guan Xuefeng. Leveraging the Power of Multi-core Platforms for Large-scale Geospatial Data Processing: Exemplified by Generating DEM from Massive LIDAR Point Clouds.
Computer &Geoscience,2010,36:1276-1282
|
被引
6
次
|
|
|
|
|
7.
NVIDIA.
NVIDIA CUDA编程指南,2010
|
被引
1
次
|
|
|
|
|
8.
黄先锋. 基于边长比约束的离散点准确边界追踪算法.
武汉大学学报. 信息科学版,2009,34(6):688-691
|
被引
8
次
|
|
|
|
|
9.
程林. 一种基于Super Map GIS的改进Dijkstra算法.
地球信息科学学报,2010,12(5):649-654
|
被引
3
次
|
|
|
|
|
10.
陈冬平. 以DEM提取流域水系河源的最小误差分析.
地球信息科学学报,2011,13(2):240-244
|
被引
5
次
|
|
|
|
|
11.
马建超. DEM栅格单元异质性对地形湿度指数提取的影响分析.
地球信息科学学报,2011,13(2):157-163
|
被引
3
次
|
|
|
|
|
了解气象卫星更多信息，请访问