GIS模型网格计算原理及算法  

Principle and Algorithm to Fulfill Grid Computing for GIS Models

作　　者：扈海波[1] 刘伟东[1] 李京[2] 朱文泉[2] 

机构地区：[1]中国气象局北京城市气象研究所,北京100089 [2]北京师范大学资源学院,北京100875

出　　处：《计算机工程》2007年第2期34-36,49,共4页Computer Engineering

基　　金：国家"863"计划基金资助项目(2002AA130020;2002AA134090);国家科技攻关计划基金资助项目(2003BA808A16);环境大气综合探测资料四维数据库技术研究项目(H020620250230)

摘　　要：GIS模型计算逐步向数据处理海量化及过程复杂化方向发展。网格计算为解决GIS应用这一难题提供了契机。GIS模型计算从运算模式上可分解为并行、串行和并行串行模式,该文在这些模式的基础上提出了实现GIS模型网格计算的原理性方法:分块加工、分步加工和立体加工方法,并以GIS和RS中的常用模型(直方图和矢量地图插值)作为算法实例,论述其并行算法实现,同时给出矢量地图数据的分块规则。该并行算法实现可作为实现其它同类算法的基础和扩展。The problem of the model computing for GIS application is that the processed-data is being more and more gigantic, and its procedure is much more complex than ever. The grid computing is the key to solve it. The computing mode of GIS model could be listed as the parallel, the serial and the parallel-serial. Based on these modes, the paper brings forward three prototypes to fulfill grid computing, such as the pieced-processing, the stepped-processing and the cubic-processing. Consequently, it also gives the principles of dividing vector data, and the parallel algorithm of histogram, convolution, and curving-fitting, which could be the basic and extension of the other more parallel algorithm for GIS application.

关 键 词：GIS模型 网格计算 并行算法 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]