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

一种基于贪婪思想的受约束网格数据传输算法
引用本文:石磊,周鑫燚.一种基于贪婪思想的受约束网格数据传输算法[J].四川教育学院学报,2010,26(4).
作者姓名:石磊  周鑫燚
作者单位:四川教育学院,计算机科学系,成都,611130
摘    要:网格中数据传输的速度对整个网格性能起着非常重要的作用,网格数据传输本质上讲是对受约束的网格环境求最大网络流的问题,文章提出了一种基于贪婪思想的受约束网格数据传输算法。该算法首先分析网络的拓扑图形,然后确定网络上链路的转发速度,生成一个带权的约束图,应用贪婪的思想逐层传递数据,当前一层数据传输发生超约束情况时,进行回退,修正上传数据传输,直到汇聚点,最终形成优化的网络流。

关 键 词:网格  数据传输  贪婪

Constrained Grid Data Transmission Algorithm Based on Greedy Thought
SHI Lei,ZHOU Xin-yi.Constrained Grid Data Transmission Algorithm Based on Greedy Thought[J].Journal of Sichuan College of Education,2010,26(4).
Authors:SHI Lei  ZHOU Xin-yi
Institution:SHI Lei; ZHOU Xin-yi(Department of Computer Science; Sichuan College of Education; Chengdu 611130; China);
Abstract:The data transmission speed is very important for the grid's performance.Grid data transmission essentially is the question that the maximal network flows during constrained grid situations being found.A constrained grid data transmission algorithm based on greedy thought is proposed in this paper.The algorithm first analyzes the analysis graph of network,then determines transmit speed of network link,produces a weighted constraint graphics,and level-by-level transfers data by the greedy thought.When the pr...
Keywords:grid  data transmission  greed  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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