Based on time and cost optimization of the dag scheduling

摘要

Acyclic graph is based on the time limit and the minimum total cost, and the use of economic law in the running of the grid user mapping tasks to the grid resources in grid environment. In this paper, the target algorithm overcomes the other related algorithm, the algorithm does not concern the priority relation between running tasks, it is not realistic. The algorithm has three key technologies: one is the extraction of directed acyclic graph critical path. This technology can effectively locate the specific time period, the task in the special resource operation. The two is in the task to run as much as possible is allowed, the task should be mapped to the price of the cheapest resources on running. Three is based on the operation sequence of each task and the predecessor successor relation to each task to carry on the stratification.