首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于负载均衡的空间线分组算法
引用本文:张纯金,魏海涛,杜云艳.基于负载均衡的空间线分组算法[J].山东科技大学学报(自然科学版),2014(6):97-102.
作者姓名:张纯金  魏海涛  杜云艳
作者单位:山东科技大学网络与信息中心;山东科技大学测绘科学与工程学院;中国科学院地理科学与资源研究所资源与环境信息系统国家重点实验室;
基金项目:国家海洋公益性行业科研专项(201105033,201105017)
摘    要:针对传统并行操作计算效率低的问题,提出以分组并行处理模式优化节点间的负载均衡。以表层浮标轨迹验证涡旋实验为例,给出面向不可分割空间线对象的快速分组方法,设计了两个分组调整算法。实验结果显示,算法可以使每个计算节点达到负载均衡。与串行计算的比较实验结果显示,算法具有较好的加速效果,且加速比随着计算节点个数的增加呈上升趋势。因此,基于负载均衡的空间线分组算法是对不可分割空间线的计算进行优化的有效途径。

关 键 词:负载均衡  线对象  并行处理  分组  浮标轨迹

The Algorithm of Spatial Line Grouping Based on Load Balancing
Institution:Zhang Chunjin , Wei Haitao, Du Yunyan (1. Network Information Center,Shandong University of Science and Technology, Qingdao,Shandong 266590,China; 2. College of Geomaties, Shandong University of Science and Technology, Qingdao, Shandong 266590,China ; 3. State Key Laboratory of Resources and Environmental Information System, Institute of Geographic Sciences and Natural Resources Research,CAS,Beijing 100101 ,China)
Abstract:To solve tbe problem of low computation efficiency in traditional parallel task operation, this paper pro- posed a grouping parallel processing mode for optimizing load balancing among computation nodes. The quick grou- ping algorithm for grouping the indivisible spatial line objects was applied to the vortex validation experiment, which is implemented by tracking surface buoy. Moreover, two group adaptation algorithms were given. The algorithm proposed in this paper balanced the load of each computation node and achieved perfect speedup. The speedup ratio increased with the numbers of computation nodes. The experimental results show that this spatial line grouping al- gorithm is an effective approach for optimizing the computation of indivisible spatial linear objects.
Keywords:load balancing  the line object  parallel processing  grouping  buoy trajectory
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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