提出了一个循环选择执行的网格任务自适应调度策略(Adaptive Min-Min and Max-Min
A-MM).实验表明
该算法在时间跨度等方面的性能较以往算法有较大提高.
Abstract
An adaptive task scheduling algorithm is studied.To the special property of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm
aiming to improve the makespan property
an adaptive Min-Min and Max-Min algorithm(A-MM) and a grid task scheduling based on grid has been proposed.The experiments show that the new algorithm overweighs the traditional ones a lot in makespan parameters.
关键词
Keywords
references
徐志伟,冯百明,李伟.网格计算技术[M].北京:电子工业出版社,2004,235-238.
Maheswaran M,Ali S,Siegel J H,et al.Dynamic Matching and Scheduling of a Class of Independent Tasks into Het-erogeneous Computing Systems[C].In the 8th 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 In-dependent Tasks onto Heterogeneous Distributed Computing Systems[J].Parallel and Distributed Computing.2001,61(6):810-837.
He Xiaoshan,Sun Xianhe,Von Laszewski Gregor.QoS Guided Min-Min Heuristic for Grid Task Scheduling[J].Journal of Computer Science and Technology,2003,18(4):442-451.