Threshold Acceptance Approach for Task Scheduling in Cloud Computing

The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the crucial issues in cloud environment is related to the task scheduling. Task scheduling is an NP-hard optimization problem and many meta-heuristic algorithms have been proposed to solve it. This paper presents the Threshold Acceptance algorithm for task scheduling to minimize both total executing time and cost. The proposed approach can be implemented on both dependent and independent tasks. By virtue of comparing proposed approach with the Simulated Annealing algorithm, the experiment results show the proposed algorithm has better results. Not only has it better scheduling performance but it also runs faster than Simulated Annealing algorithm in a large scale. In addition, the experimental results show that the proposed algorithm can substantially achieve both minimal cost and minimal time

کلیدواژه ها:

Cloud computer ، distributed systems ، task scheduling ، threshold accepting algorithm ، simulated annealing algorithm