检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:欧剑[1,2,3] 张行南[2] 左一鸣[4] 马进荣[2] 祝中昊
机构地区:[1]河海大学海岸灾害及防护教育部重点实验室,江苏南京210098 [2]河海大学水文水资源与水利工程科学国家重点实验室,江苏南京210098 [3]浙江水利水电专科学校水利工程系,浙江杭州310018 [4]太湖流域管理局水利发展研究中心,上海200434 [5]镇江市润州区水利局,江苏镇江212005
出 处:《江苏大学学报(自然科学版)》2009年第5期518-522,共5页Journal of Jiangsu University:Natural Science Edition
基 金:国家自然科学基金资助项目(50879017);水文水资源与水利工程科学国家重点实验室开放研究基金资助项目(2008491211);海岸灾害及防护教育部重点实验室开放研究基金资助项目(200807);教育部博士点基金资助项目(20060294002)
摘 要:运用并行计算,求解一维河网Preissman四点隐式差分格式离散方程组中耗时最多的节点水位方程组,有效缩减了模型的求解时间.针对当前商业并行编程平台不能实现进程迁移和网络异常情况下无法保证计算结果正确性的现状,自主开发了并行通讯平台,并根据模型并行计算需要制定了相关通讯协议.以上海浦东河网为例进行了数值模拟.结果表明:当河道数一定时,存在最优客户端数;当客户端数小于最优客户端数时,并行算法所需时间小于串行算法时间,并随着客户端数增加所需时间也逐渐减少;反之,所需时间则逐渐增大.The Preissman four-point implicit difference scheme discrete equations for one-dimensional river, parallel algorithm is used to solve the node equations for water level calculation, which is very time-consuming. Parallel algorithm can effectively reduce the computation time. Since the current parallel programming platforms could not guarantee the correct solution of the problem during the process migration and network exceptions, a parallel communications platform is developed to meet the need for parallel computing model. The relevant internal communication protocols are formulated. The numerical simulation is carried out on river section in Pudong, Shanghai as an example. The results show that when the river is in a static status, a number of optimal clients exist. When the number of client is less than the optimal number, the parallel algorithm requires less time than the serial algorithm, and the required time gradually reduces with the increase of the number of clients. Otherwise, the required time for computation gradually increases.
分 类 号:TV133.2[水利工程—水力学及河流动力学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.85