Cloud Workflow Arrangement with Deadline and Point Period Accessibility

Abstract

Nowadays much attention has been paid on workflow scheduling in service computing environments (cloud computing, grid computing, Web services, etc). Resources are generally provided in the form of services, especially in cloud computing. Allocating service capacities in cloud computing is based on the idea that they're unlimited and may be used atany time. However, available service capacities change with workload and can't satisfy users’ requests at any time from the cloudprovider’s perspective because cloud services are shared by multiple tasks. Cloud service suppliers provide available time slots for new user’s requests based on available capacities. during this paper, we tend to consider workflow scheduling with deadline and time slot availability in cloud computing. An iterated heuristic framework is given for the problem under study that mainly consists ofinitial solution construction, improvement, and perturbation. 3 initial solution construction methods, 2 greedy- and fair-based improvement methods and a perturbation strategy are proposed. Totally different methods within the 3 phases end in many heuristics. Experimental results show that different initial solution and improvement strategies have different effects on solution qualities.