Genetic and static algorithm for task scheduling in cloud computing
by Jocksam G. De Matos; Carla K. De M. Marques; Carlos H.P. Liberalino
International Journal of Cloud Computing (IJCC), Vol. 8, No. 1, 2019

Abstract: Technological advancement has required ever more computing resources. In this context the cloud computing emerges as a new paradigm to meet this demand, though its resources are physically limited due to the growing data traffic that the system may be subject. The task scheduling aims to distribute tasks in order to make them more efficient in the use of computing resources. Thus, this paper aims to propose a solution to the task scheduling problem in cloud computing to reduce the processing time of the tasks and the number of virtual machines (VM). The metaheuristic genetic algorithm (GA) was used in the first stage of the algorithm, in order to reduce the processing time of the tasks. The static algorithm is designed to solve the set partitioning problem. Their performance was compared with two algorithms, classic and heuristic, along with realistic workloads.

Online publication date: Fri, 22-Feb-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Cloud Computing (IJCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com