基于二维滑动窗口的数据网格通信模型  

Data grid communication model based on 2D-slider windows

作　　者：陈庆奎[1] 那丽春[2] 曲春雷 

机构地区：[1]上海理工大学计算机工程学院,上海200093 [2]上海立信会计学院信息科学系,上海201620 [3]黑龙江省航道局,黑龙江哈尔滨150026

出　　处：《通信学报》2006年第12期76-82,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(60573108);上海自然科学基金资助项目(04ZR14100);上海市重点学科建设项目(T0502);黑龙江省自然科学基金资助项目(F9905)~~

摘　　要：在由多计算机集群构成的数据密集型网格环境下,为了解决通信峰值阶段的通信冲突问题,提出了一个基于二维滑动窗口机制的通信模型。给出了由多计算机机群构成的数据密集型网格数据节点DGDN(data-intensivegriddatanode)、完全图通信和二维滑动窗口等一系列形式化定义;利用计算节点和网络的通信能力,研究了二维滑动窗口机制,描述了单个机群内的完全图通信算法CA2DSW(communicationalgorithmbased2D-sliderwindow)以及双机群内的计算机之间的完全图通信算法CADC(communicationalgorithmindoublecluster)。基于网络距离机制、CA2DSW和CADC,设计了DGDN上的通信模型CMDGDN。理论分析和实验结果表明,该模型有效地解决了数据网格环境下通信峰值所造成的并行计算效率低下的问题。该模型适合于基于网格的数据密集型并行计算。For resolving the conflict problem of the peak communication in data-intensive grid that composed of computer clusters, a communication model based on 2D-slider window was discussed. A series of formal definitions, such as DGDN （data-intensive grid data node）, the complete graph communication and 2D-slider window（2DSW）, were proposed. By using the abilities of computing nodes and networks, the 2DSW mechanism was studied. The complete graph communication algorithms based on 2DSW （CA2DSW） in the single computer cluster and the complete graph communication algorithm in double clusters （CADC） were described. Basing on network distance, CA2DSW and CADC, the complete graph communication model in DGDN （CMDGDN） was designed. The analysis and experiment results show that CMDGDN effectively resolve the low efficiency during the peak communication in grid. It can be fit for the data-intensive parallel computing based in grid.

关 键 词：数据密集网格 完全图通信 峰值通信 二维滑动窗口 

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