Time-Cost Tradeoff Dynamic Scheduling Algorithm for Workflows in Grids

Service resources allocation and scheduling is one of the challenging and complex problems in computation-economy-driven open grid service architecture. This paper proposes a time-cost tradeoff workflow scheduling algorithm in which cost is optimized for schedules with the expectation to minimize workflow duration. Dynamic service selection strategy is adopted to adapt to dynamic shared and autonomous resources in grids. Simulation results show that the algorithm can achieve less completion time and lower cost which can meet requirements in practical applications