侯勇, 吾守尔·斯拉木, 李冉. 新的动态启发式网格任务调度算法[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 111(3): 356-359.DOI:
新的动态启发式网格任务调度算法
摘要
详细对比了传统Min-Min算法的高效特性和Max-Min算法的负载平衡特性
在原先提出以改善任务调度时间跨度性能为目标的网格任务自适应调度策略A-MM基础上
提出新的具有动态特性的启发式算法(Heuristic task scheduling algorithm based on Min-Min and Max-Min
H-MM)
解决了A-MM不能动态执行的缺点.实验表明
H-MM在充分保留A-MM算法优点基础上实现了算法的动态执行特性
得到了更好的任务调度执行效果.
Abstract
Comparing the special property of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm
for improving the makespan property
a Heuristic task scheduling algorithm based on Min-Min and Max-Min
H-MM based on A-MM
has been proposed. H-MM solved the defect of undynamic of A-MM. The experiments show that H-MM exploit the merit of A-MM while solve the problem of undynamic. Moreover
the algorithm overweighs traditional algorithms a lot in makespan parameters.
关键词
Keywords
references
徐志伟,冯百明,李伟.网格计算技术[M].北京:电子工业出版社,2004,235-238.
Maheswaran M,Ali S,J.Siegel H,et al.Dynamic Matching and Scheduling of a Class of Independent Tasks into Heterogeneous Computing Systems[C].In the8th IEEE Heterogeneous Computing Workshop(HCW’99),1999,30-44.
Tracy D Braun,Howard Jay Siegel,Noah Beck.A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems[J].Parallel and Distributed Computing,2001,61(6):810-837.
Yong Hou,Jiong Yu and Turgun.NDA-MM:A New Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid[C].Sixth International Conference on Grid and Cooperative Computing,2007,275-281.
Tracy D Braun,Howard Jay Siegel,Noah Beck.A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems[J].J of Parallel and Distributed Computing,2001,61(6):810-837.