Simulated annealing approach to cost-based multi-quality of service job scheduling in cloud computing enviroment

18Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Cloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. 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 fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks with minimum scheduler execution time. A Genetic Algorithm (GA) for job scheduling has been proposed and produced good results. The main disadvantage of GA algorithm is time consuming problem. In this study, a novel Simulated Annealing (SA) algorithm is proposed for scheduling task in cloud environment. SA based approach produced comparative result in a minimal execution time. © 2014 Science Publication.

Cite

CITATION STYLE

APA

Abdullah, M., & Othman, M. (2014). Simulated annealing approach to cost-based multi-quality of service job scheduling in cloud computing enviroment. American Journal of Applied Sciences, 11(6), 872–877. https://doi.org/10.3844/ajassp.2014.872.877

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free