Data grid communication model based on 2D-slider windows
Qingkui Chen · Journal of Communications · 2006
For resolving the conflict problem of the peak communication in data-intensive grid that composed of com-puter 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 pro-posed. 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 commu-nication 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.