A new task Pre-scheduling algorithm by Reduction of Critical Path Length in Grid Computing

In this paper, we propose a new algorithm for restructuring task graphs for suitable scheduling in grid computing. This algorithm obtains the critical path length in task graph and then start to reduce the length of this path. For optimize the length of critical path To do this. this algorithm reduces communication costs by merging tasks from task graph who are pertained to this path and their communication costs exceed their execution time. Task duplication techniques are applied when the task merging operation on critical path change at least the length of one of other paths and its length is greater than the updated critical path length .Afterward, these operations apply to the new critical path, if it exists .this algorithm changing critical path to optimized path example is shown to improve performance

کلیدواژه ها:

Task graphs ، Critical path ، Merging ، Duplication ، Scheduling