Parallelizing flow-accumulation calculations on graphics processing units-From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm | |
Qin C. Z. ; Zhan Li Jun(占利军) | |
刊名 | Computers & Geosciences
![]() |
2012 | |
卷号 | 43页码:7-16 |
关键词 | Parallel computing Graphics processing unit (GPU) Digital terrain analysis Flow accumulation Multiple-flow-direction algorithm (MFD) DEM preprocessing digital elevation models catchment-area extraction topmodel |
ISSN号 | 0098-3004 |
通讯作者 | Qin, CZ |
英文摘要 | As one of the important tasks in digital terrain analysis, the calculation of flow accumulations from gridded digital elevation models (DEMs) usually involves two steps in a real application: (1) using an iterative DEM preprocessing algorithm to remove the depressions and flat areas commonly contained in real DEMs, and (2) using a recursive flow-direction algorithm to calculate the flow accumulation for every cell in the DEM. Because both algorithms are computationally intensive, quick calculation of the flow accumulations from a DEM (especially for a large area) presents a practical challenge to personal computer (PC) users. In recent years, rapid increases in hardware capacity of the graphics processing units (GPUs) provided in modern PCs have made it possible to meet this challenge in a PC environment. Parallel computing on GPUs using a compute-unified-device-architecture (CUDA) programming model has been explored to speed up the execution of the single-flow-direction algorithm (SFD). However, the parallel implementation on a GPU of the multiple-flow-direction (MFD) algorithm, which generally performs better than the SFD algorithm, has not been reported. Moreover, GPU-based parallelization of the DEM preprocessing step in the flow-accumulation calculations has not been addressed. This paper proposes a parallel approach to calculate flow accumulations (including both iterative DEM preprocessing and a recursive MFD algorithm) on a CUDA-compatible GPU. For the parallelization of an MFD algorithm (MFD-md), two different parallelization strategies using a GPU are explored. The first parallelization strategy, which has been used in the existing parallel SFD algorithm on GPU, has the problem of computing redundancy. Therefore, we designed a parallelization strategy based on graph theory. The application results show that the proposed parallel approach to calculate flow accumulations on a GPU performs much faster than either sequential algorithms or other parallel GPU-based algorithms based on existing parallelization strategies. (C) 2012 Elsevier Ltd. All rights reserved. |
收录类别 | SCI |
资助信息 | National High-Tech Research and Development Program of China 2011AA120302;Chinese Academy of Sciences KZCX2-YW-Q10-1-5;National Natural Science Foundation of China 40971235;Institute of Geographical Sciences and Natural Resources Research 2011RC203 |
公开日期 | 2012-09-04 |
内容类型 | 期刊论文 |
源URL | [http://ir.igsnrr.ac.cn/handle/311030/26814] ![]() |
专题 | 地理科学与资源研究所_研究生部 |
推荐引用方式 GB/T 7714 | Qin C. Z.,Zhan Li Jun. Parallelizing flow-accumulation calculations on graphics processing units-From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm[J]. Computers & Geosciences,2012,43:7-16. |
APA | Qin C. Z.,&Zhan Li Jun.(2012).Parallelizing flow-accumulation calculations on graphics processing units-From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm.Computers & Geosciences,43,7-16. |
MLA | Qin C. Z.,et al."Parallelizing flow-accumulation calculations on graphics processing units-From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm".Computers & Geosciences 43(2012):7-16. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论