首页 | 官方网站   微博 | 高级检索  
     

一种基于负载均衡性的网格任务调度算法
引用本文:黄海于,何大可.一种基于负载均衡性的网格任务调度算法[J].计算机工程,2010,36(2):58-60.
作者姓名:黄海于  何大可
作者单位:西南交通大学信息科学与技术学院,成都,610031
摘    要:针对二分图匹配算法在任务之间存在时序关系时无法进行有效调度以及EFT算法没有充分考虑各处理机性能及网络通信状况的问题,提出基于二分图匹配的改进ETF算法。该算法综合考虑任务之间的时序关系、处理机的性能、处理机之间的通信情况及已处理任务的调度情况,利用二分图最佳匹配思想对局部任务进行调度。实验表明该算法具有较小的调度长度和较好的负载均衡性。

关 键 词:异构计算环境  任务调度  二分图最佳匹配  ETF算法  负载均衡性
修稿时间: 

Grid Task Schedule Algorithm Based on Load Balance
HUANG Hai-yu,HE Da-ke.Grid Task Schedule Algorithm Based on Load Balance[J].Computer Engineering,2010,36(2):58-60.
Authors:HUANG Hai-yu  HE Da-ke
Affiliation:(School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031)
Abstract:Among the task schedule algorithms, optimal bipartite matching can not be used for scheduling the DAG tasks directly, and the computing capabilities of machines and communication times used for data transfers between them are not considered in Earliest Time Path(ETF) algorithm. Considering such problems, an improved ETF task schedule algorithm based on optimal bipartite matching for heterogeneous computing environment is provided. Based on optimal bipartite matching for independent tasks and ETF algorithm, the algorithm considers not only the execution orders of the tasks and performance of the machines, but also the capabilities of communication between each machines and the results of the previous schedule results. Simulation experiments demonstrate that the algorithm can significantly improve the schedule performance in terms of schedule length and load balance.
Keywords:heterogeneous computing environment  task schedule  optimal bipartite matching  Earliest Time Path(ETF) algorithm  load balance
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号