基于网格工作流的列表启发式算法研究

List Heuristics Scheduling Algorithm Based on Grid Workflow

将用户定义的具体网格工作流抽象为DAG图,在DAG图中找到其关键路径,根据关键路径和用户的类型来计算任务的预测执行时间,确定任务的优先级,再比较若干候选资源,选择性价比较高的资源进行任务分配调度算法。

To abstract the specific user-defined grid workflow for DAG, to find the DAG critical path. According to the critical path and the type of user to calculate the task of forecasting the implementation of time to determine the priority tasks, and then compare candidates for a number of resources, to choose the higher cost of the allocation of resources to the task scheduling algorithm.