基于生存性和Makespan的多目标网格任务调度算法研究  

Research on multi-objective grid task scheduling algorithms based on survivability and Makespan

作　　者：王树鹏[1] 云晓春[1] 余翔湛[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《通信学报》2006年第2期42-49,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(90412001);"十五"国防预研基金资助项目(41315.7.3);国家重点基础研究发展计划("973"计划)基金资助项目(2005CB321806)~~

摘　　要：在动态、复杂的网格系统中,资源的失效非常频繁,网格资源的失效会导致在该节点上执行的计算任务无法正常完成,从而影响网格计算的服务质量和效率。针对这个问题,提出了任务生存性(survivability)的概念,将任务生存性与Makespan结合起来,给出了一个可调节的局部目标函数,实现了基于生存性和Makespan的Min-min启发式调度算法(SM-Min-min)。实验证明该算法能够有效地平衡Makespan和任务生存性目标,并可以通过调节目标函数中的偏好参数满足不同的需求,因此更适合开放复杂的计算网格环境。In the complex and dynamic Grid system, failure of resources was very common. And the failure of Grid resources can halt the execution of tasks on them, To mitigate this problem, the concept of tasks survivability was proposed, a local objective function which can be adjusted was proposed by incorporating the makespan and survivability of tasks and maximizing the survivability of tasks was devised, The simulation results confirm that the scheduling algorithm can trade off these two objectives, and can satisfy different demand by adjusting the weight parameter in the objective function. So it can be applied in the complex Grid computing environment well.

关 键 词：网格 任务调度 任务生存性 MAKESPAN 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]