首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 156 毫秒
1.
The demand for parallel geocomputation based on raster data is constantly increasing with the increase of the volume of raster data for applications and the complexity of geocomputation processing. The difficulty of parallel programming and the poor portability of parallel programs between different parallel computing platforms greatly limit the development and application of parallel raster-based geocomputation algorithms. A strategy that hides the parallel details from the developer of raster-based geocomputation algorithms provides a promising way towards solving this problem. However, existing parallel raster-based libraries cannot solve the problem of the poor portability of parallel programs. This paper presents such a strategy to overcome the poor portability, along with a set of parallel raster-based geocomputation operators (PaRGO) designed and implemented under this strategy. The developed operators are compatible with three popular types of parallel computing platforms: graphics processing unit supported by compute unified device architecture, Beowulf cluster supported by message passing interface (MPI), and symmetrical multiprocessing cluster supported by MPI and open multiprocessing, which make the details of the parallel programming and the parallel hardware architecture transparent to users. By using PaRGO in a style similar to sequential program coding, geocomputation developers can quickly develop parallel raster-based geocomputation algorithms compatible with three popular parallel computing platforms. Practical applications in implementing two algorithms for digital terrain analysis show the effectiveness of PaRGO.  相似文献   

2.
Conventionally, a raster operation that needs to scan the entire image employs only one scanning order (i.e., single scanning order (SSO)), and the scan usually runs from upper left to lower right and row by row. We explore the idea of alternately applying multiple scanning orders (MSO) to raster operations that are based on the local direction, using the flow accumulation (FA) calculation as an example. We constructed several FA methods based on MSO, and compared them with those widely used methods. Our comparison includes experiments over digital elevation models (DEMs) of different landforms and DEMs of different resolutions. For each DEM, we calculated both single-direction FA (SD-FA) and multi-direction FA (MD-FA). In the theoretical aspect, we deducted the time complexity of an MSO sequential algorithm (MSOsq) for FA based on empirical equations in hydrology. Findings from the experiments include the following: (1) an MSO-based method is generally superior to its counterpart SSO-based method. (2) The advantage of MSO is more significant in the SD-FA calculation than in the MD-FA calculation. (3) For SD-FA, the best method among the compared methods is the one that combines the MSOsq and the depth-first algorithm. This method surpasses the commonly recommended dependency graph algorithm, in both speed and memory use. (4) The differences between the compared methods are not sensitive to specific landforms. (5) For SD-FA, the advantage of MSO-based methods is more obvious in a higher DEM resolution, but this does not apply to MD-FA.  相似文献   

3.
总结了数字高程模型构建、特征提取等并行算法的研究进展,概述了不同并行算法的主要内容;探讨了DTA并行技术在海量地形数据可视化和高性能地学计算的应用,随着DEM的需求日益增大,高精度、高分辨率DEM产品及其附加服务也逐步产品化。最后,通过分析并行计算发展的关键问题,提出DTA并行技术的研究趋势及研究意义,合适的数据划分和结果融合策略、通用并行算法、容错机制和负载均衡策略的设计是今后研究的重要内容,尤其是如何在多种计算模式共同发展的背景下利用并行计算解决地学难题,从而得到更接近现实世界地理环境的模拟,并扩大数字地形分析的应用范围。  相似文献   

4.
基于DEM的复杂地形流域特征提取   总被引：21，自引：2，他引：19  
利用流域数字高程模型(DEM)构建数字水系模型并提取流域水系特征是分布式水文过程模拟的重要前提。提出了面向分布式水文过程模拟和流域特征提取的数字水系模型,并针对现有方法对复杂地形DEM中含有的平地、洼地及其嵌套情形的处理不足,提出了栅格水流分类、填洼分类与归并及有效填平处理、河谷平地的出流代价法构建栅格流向和流序等新的处理方法,并在开发的软件系统得到实现。使用该方法创建的黄土岭流域数字水系模型和提取的水系等流域特征结果表明:本文方法可有效应对复杂地形流域的处理,提取的流域水系特征与实际自然水系比较吻合,能够有效地消除现有方法在地形平坦区域容易产生的平行河道、奇异河道、河道变形等不足。  相似文献   

5.
矢量数据向栅格数据转换的一种改进算法   总被引：13，自引：0，他引：13  
地理信息系统的发展与空间数据结构的优化密不可分,栅格数据与矢量数据之间的高效转换是GIS的关键技术之一。由于栅格数据十分有利于空间分析中的叠置分析,因而通常需要将矢量数据转换成栅格数据。该文分析对比了地理信息系统的两种基本数据结构,在总结已往矢量数据转换为栅格数据方法的基础上,依据边界代数多边形填充算法的基本原理,结合绘图作业时采用的正负法,提出了一种改进的折线边界(数据串)跟踪方法。该算法原理简单,不需进行复杂的距离比较运算,运算速度快,并且通过简单的角度判断保证了填充的精度。  相似文献   

6.
A general-purpose parallel raster processing programming library (pRPL) was developed and applied to speed up a commonly used cellular automaton model with known tractability limitations. The library is suitable for use by geographic information scientists with basic programming skills, but who lack knowledge and experience of parallel computing and programming. pRPL is a general-purpose programming library that provides generic support for raster processing, including local-scope, neighborhood-scope, regional-scope, and global-scope algorithms as long as they are parallelizable. The library also supports multilayer algorithms. Besides the standard data domain decomposition methods, pRPL provides a spatially adaptive quad-tree-based decomposition to produce more evenly distributed workloads among processors. Data parallelism and task parallelism are supported, with both static and dynamic load-balancing. By grouping processors, pRPL also supports data–task hybrid parallelism, i.e., data parallelism within a processor group and task parallelism among processor groups. pSLEUTH, a parallel version of a well-known cellular automata model for simulating urban land-use change (SLEUTH), was developed to demonstrate full utilization of the advanced features of pRPL. Experiments with real-world data sets were conducted and the performance of pSLEUTH measured. We conclude not only that pRPL greatly reduces the development complexity of implementing a parallel raster-processing algorithm, it also greatly reduces the computing time of computationally intensive raster-processing algorithms, as demonstrated with pSLEUTH.  相似文献   

7.
作为GIS的核心功能之一,空间分析逐步向处理数据海量化及分析过程复杂化方向发展,以往的串行算法渐渐不能满足人们对空间分析在计算效率、性能等方面的需求,并行空间分析算法作为解决目前问题的有效途径受到越来越多的关注。该文在简要介绍空间分析方法和并行计算技术的基础上,着重从矢量算法与栅格算法两方面阐述了目前并行空间分析算法的研究进展,评述了在空间数据自身特殊性的影响下并行空间分析算法的发展方向及存在的问题,探讨了在计算机软硬件技术高速发展的新背景下并行空间分析算法设计面临的机遇与挑战。  相似文献   

8.
Abstract

In this paper we address the problem of computing visibility information on digital terrain models in parallel. We propose a parallel algorithm for computing the visible region of an observation point located on the terrain. The algorithm is based on a sequential triangle-sorting visibility approach proposed by De Floriani et al. (1989). Static and dynamic parallelization strategies, both in terms of partitioning criteria and scheduling policies, are discussed. The different parallelization strategies are implemented on an MIMD multicomputer and evaluated through experimental results.  相似文献   

9.
Cellular automata (CA) models can simulate complex urban systems through simple rules and have become important tools for studying the spatio-temporal evolution of urban land use. However, the multiple and large-volume data layers, massive geospatial processing and complicated algorithms for automatic calibration in the urban CA models require a high level of computational capability. Unfortunately, the limited performance of sequential computation on a single computing unit (i.e. a central processing unit (CPU) or a graphics processing unit (GPU)) and the high cost of parallel design and programming make it difficult to establish a high-performance urban CA model. As a result of its powerful computational ability and scalability, the vectorization paradigm is becoming increasingly important and has received wide attention with regard to this kind of computational problem. This paper presents a high-performance CA model using vectorization and parallel computing technology for the computation-intensive and data-intensive geospatial processing in urban simulation. To transfer the original algorithm to a vectorized algorithm, we define the neighborhood set of the cell space and improve the operation paradigm of neighborhood computation, transition probability calculation, and cell state transition. The experiments undertaken in this study demonstrate that the vectorized algorithm can greatly reduce the computation time, especially in the environment of a vector programming language, and it is possible to parallelize the algorithm as the data volume increases. The execution time for the simulation of 5-m resolution and 3 × 3 neighborhood decreased from 38,220.43 s to 803.36 s with the vectorized algorithm and was further shortened to 476.54 s by dividing the domain into four computing units. The experiments also indicated that the computational efficiency of the vectorized algorithm is closely related to the neighborhood size and configuration, as well as the shape of the research domain. We can conclude that the combination of vectorization and parallel computing technology can provide scalable solutions to significantly improve the applicability of urban CA.  相似文献   

10.
Abstract

Large spatial interpolation problems present significant computational challenges even for the fastest workstations. In this paper we demonstrate how parallel processing can be used to reduce computation times to levels that are suitable for interactive interpolation analyses of large spatial databases. Though the approach developed in this paper can be used with a wide variety of interpolation algorithms, we specifically contrast the results obtained from a global ‘brute force’ inverse–distance weighted interpolation algorithm with those obtained using a much more efficient local approach. The parallel versions of both implementations are superior to their sequential counterparts. However, the local version of the parallel algorithm provides the best overall performance.  相似文献   

11.
This paper presents the structure and contents of a standardised geomorphological GIS database that stores comprehensive scientific geomorphological data and constitutes the basis for processing and extracting spatial thematic data. The geodatabase contains spatial information on morphography/morphometry, hydrography, lithology, genesis, processes and age. A unique characteristic of the GIS geodatabase is that it is constructed in parallel with a new comprehensive geomorphological mapping system designed with GIS applications in mind. This close coupling enables easy digitalisation of the information from the geomorphological map into the GIS database for use in both scientific and practical applications. The selected platform, in which the geomorphological vector, raster and tabular data are stored, is the ESRI Personal geodatabase. Additional data such as an image of the original geomorphological map, DEMs or aerial orthographic images are also included in the database. The structure of the geomorphological database presented in this paper is exemplified for a study site around Liden, central Sweden.  相似文献   

12.
基于HYDRO1K、SRTM3和ASTER GDEM三种DEM数据,利用BTOPMC地形子模型提取韩江流域河网,并作对比分析。结果表明:①SRTM3提取的河网精度最高,HYDRO1K相对最低。②DEM的垂直精度对提取的河网精度起控制作用。ASTER GDEM的水平分辨率较高,但垂直精度不如SRTM3,因而提取的河网精度不如SRTM3。③HYDRO1K提取大尺度流域河网具有一定的精度,但在地势平坦区域的效果较差,HY-DRO1K不宜用来提取小尺度流域河网。④由DEM提取的数字河网精度与当地的地面坡度以及处理DEM的填洼算法有关。  相似文献   

13.
Polygon intersection is an important spatial data-handling process, on which many spatial operations are based. However, this process is computationally intensive because it involves the detection and calculation of polygon intersections. We addressed this computation issue based on two perspectives. First, we improved a method called boundary algebra filling to efficiently rasterize the input polygons. Polygon intersections were subsequently detected in the cells of the raster. Owing to the use of a raster data structure, this method offers advantages of reduced task dependence and improved performance. Based on this method, we developed parallel strategies for different procedures in terms of workload decomposition and task scheduling. Thus, the workload across different parallel processes can be balanced. The results suggest that our method can effectively accelerate the process of polygon intersection. When addressing datasets with 1,409,020 groups of overlapping polygons, our method could reduce the total execution time from 987.82 to 53.66 s, thereby obtaining an optimal speedup ratio of 18.41 while consistently balancing the workloads. We also tested the effect of task scheduling on the parallel efficiency, showing that reducing the total runtime is effective, especially for a lower number of processes. Finally, the good scalability of the method is demonstrated.  相似文献   

14.
As geospatial researchers' access to high-performance computing clusters continues to increase alongside the availability of high-resolution spatial data, it is imperative that techniques are devised to exploit these clusters' ability to quickly process and analyze large amounts of information. This research concentrates on the parallel computation of A Multidirectional Optimal Ecotope-Based Algorithm (AMOEBA). AMOEBA is used to derive spatial weight matrices for spatial autoregressive models and as a method for identifying irregularly shaped spatial clusters. While improvements have been made to the original ‘exhaustive’ algorithm, the resulting ‘constructive’ algorithm can still take a significant amount of time to complete with large datasets. This article outlines a parallel implementation of AMOEBA (the P-AMOEBA) written in Java utilizing the message passing library MPJ Express. In order to account for differing types of spatial grid data, two decomposition methods are developed and tested. The benefits of using the new parallel algorithm are demonstrated on an example dataset. Results show that different decompositions of spatial data affect the computational load balance across multiple processors and that the parallel version of AMOEBA achieves substantially faster runtimes than those reported in related publications.  相似文献   

15.
由于DEM数据不包括河流、湖泊(水库)及流域边界和堤坝等信息,因此常规仅依靠DEM提取水系的方法不能反映平坦区域及受人类影响强烈区域水系的真实特征。该文建立了融合DEM、河流、湖泊水库、流域边界和堤坝等多源数字信息的流域水系提取方法,对多源信息进行栅格化,采用所提出的高程-距离函数对DEM进行校正,使得提取的数字水系与实际水系精确拟合。将该方法应用于山区太湖西苕溪流域老石坎水库及其上游集水区和平原丘陵分布区的淮河史灌河蒋家集站、梅山、鲇鱼山水库区间流域,提取的河网结构与地图信息拟合较好。  相似文献   

16.
GPU加速的多边形叠加分析   总被引：2，自引：0，他引：2  
叠加分析是地理信息系统最重要的分析功能之一,对多边形图层进行叠加分析要花费大量时间。为此,将GPU用于多边形叠加分析过程中的MBR过滤及多边形剪裁两个阶段。对MBR过滤阶段,提出了基于GPU的通过直方图及并行前置和实现的MBR过滤算法。对多边形剪裁阶段,通过改进Weiler-Atherton算法,使用新的焦点插入方法和简化的出入点标记算法,并结合并行前置和算法,提出了基于GPU的多边形剪裁算法。对实现过程中可能出现的负载不均衡情况,给出了基于动态规划的负载均衡方法。通过对这些算法的应用,实现对过滤阶段及精炼阶段的加速。实验结果表明,基于GPU的MBR过滤方法相对CPU实现的加速比为3.8,而基于GPU的多边形剪裁的速度比CPU实现快3.4倍。整体上,与CPU实现相比,GPU加速的多边形叠加提供了3倍以上的加速比。  相似文献   

17.
分布式水文模型的并行计算研究进展   总被引：3，自引：1，他引：2  
大流域、高分辨率、多过程耦合的分布式水文模拟计算量巨大,传统串行计算技术不能满足其对计算能力的需求,因此需要借助于并行计算的支持。本文首先从空间、时间和子过程三个角度对分布式水文模型的可并行性进行了分析,指出空间分解的方式是分布式水文模型并行计算的首选方式,并从空间分解的角度对水文子过程计算方法和分布式水文模型进行了分类。然后对分布式水文模型的并行计算研究现状进行了总结。其中,在空间分解方式的并行计算方面,现有研究大多以子流域作为并行计算的基本调度单元;在时间角度的并行计算方面,有学者对时空域双重离散的并行计算方法进行了初步研究。最后,从并行算法设计、流域系统综合模拟的并行计算框架和支持并行计算的高性能数据读写方法3个方面讨论了当前存在的关键问题和未来的发展方向。  相似文献   

18.
一种顾及属性的游程编码“交”运算方法与实验   总被引：1，自引：0，他引：1  
考虑到基于直接编码的栅格数据在计算效率和存储能力上的不足,提出一种便于代数操作的游程编码数据结构,以优化基于直接编码栅格数据的代数运算.介绍了基于该数据结构的游程"交"运算的实现方法,并在算法实现过程中完成游程属性的各种代数运算.算法实现思路为:将栅格场中任一行游程集合以链表的形式存储,将欲执行代数运算的新游程单元与对应栅格行游程集合执行游程"交"运算,并在插入删除游程结点的过程中完成属性值的代数运算.该算法通用性较强,在数据精度及计算效率方面比直接栅格编码方法具有优势.  相似文献   

19.
In this paper, we report efforts to develop a parallel implementation of the p-compact regionalization problem suitable for multi-core desktop and high-performance computing environments. Regionalization for data aggregation is a key component of many spatial analytical workflows that are known to be NP-Hard. We utilize a low communication cost parallel implementation technique that provides a benchmark for more complex implementations of this algorithm. Both the initialization phase, utilizing a Memory-based Randomized Greedy and Edge Reassignment (MERGE) algorithm, and the local search phase, utilizing Simulated Annealing, are distributed over available compute cores. Our results suggest that the proposed parallelization strategy is capable of solving the compactness-driven regionalization problem both efficiently and effectively. We expect this work to advance CyberGIS research by extending its application areas into the regionalization world and to make a contribution to the spatial analysis community by proposing this parallelization strategy to solve large regionalization problems efficiently.  相似文献   

20.
Abstract

Many geographical information systems offer the possibility of converting vector data to raster data and using the raster pattern for analysis. This conversion process is already well known and has been used for many years. This paper shows how a selection of eight geographical information systems convert vector test data to a raster pattern. Each system handles this process in its own way, giving results that differ both in number and in the location of assigned raster cells in the raster pattern. The results of the conversions are compared with a desired raster pattern based on five simple principles. Suggestions are made about standardizing the process of conversion for all geographical information systems to make it possible to create and exchange data more safely.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号