Hybridization of Genetic and Group Search Optimization Algorithm for Deadline-Constrained Task Scheduling Approach

Journal of Intelligent Systems 28 (1):153-171 (2019)
  Copy   BIBTEX

Abstract

Cloud computing is an emerging technology in distributed computing, which facilitates pay per model as per user demand and requirement. Cloud consists of a collection of virtual machines, which includes both computational and storage facility. In this paper, a task scheduling scheme on diverse computing systems using a hybridization of genetic and group search optimization algorithm is proposed. The basic idea of our approach is to exploit the advantages of both genetic algorithm and group search optimization algorithms while avoiding their drawbacks. In GGSO, each dimension of a solution symbolizes a task, and a solution, as a whole, signifies all task priorities. The important issue is how to assign user tasks to maximize the income of infrastructure as a service provider while promising quality of service. The generated solution is competent to assure user-level and improve Iaas providers’ credibility and economic benefit. The GGSO method also designs the producer, scrounger ranger, crossover operator, and suitable fitness function of the corresponding task. According to the evolved results, it has been found that our algorithm always outperforms the traditional algorithms.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Constrained Multiple Goal Optimization as a Theory of the Firm.Duane Windsor - 2007 - Proceedings of the International Association for Business and Society 18:283-288.

Analytics

Added to PP
2017-12-14

Downloads
4 (#1,590,841)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references