CAJ | 학술논문

The conventional deadline and budget constrained (DBC) scheduling heuristics for economic-based computational grids does not take the inconsistency of grid heterogeneity into account, which can lead to decline of application completion ratios. Motivated by this fact, a novel DBC scheduling heuristics was proposed to deal with sequential workflow applications. In order to valuate the inconsistency, the relative cost (RC) metric was introduced, which was used to indicate the task-starving degree for resources. The new algorithm assigns tasks to resources, considering completion time, budget and RC together. The GridSim toolkit and the benchmark suites of the standard performance evaluation corporation (SPEC) were used to simulate the heterogeneous grid environment and applications. The experimental results show that the task and workflow completion ratios of the new heuristics are higher than those of the conventional heuristics.