Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • 2nd Floor, #7a, High School Road, Secretariat Colony Ambattur, Chennai-600053 (Landmark: SRM School) Tamil Nadu, India
  • pro@slogix.in
  • +91- 81240 01111

Social List

DCHG-TS: a deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing - 2020

DCHG-TS: a deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing

Research Area:  Cloud Computing

Abstract:

Cloud infrastructures are suitable environments for processing large scientific workflows. Nowadays, new challenges are emerging in the field of optimizing workflows such that it can meet users service quality requirements. The key to workflow optimization is the scheduling of workflow tasks, which is a famous NP-hard problem. Although several methods have been proposed based on the genetic algorithm for task scheduling in clouds, our proposed method is more efficient than other proposed methods due to the use of new genetic operators as well as modified genetic operators and the use of load balancing routine. Moreover, a solution obtained from a heuristic used as one of the initial population chromosomes and an efficient routine also used for generating the rest of the primary population chromosomes. An adaptive fitness function is used that takes into account both cost and makespan. The algorithm introduced in this paper utilizes a load balancing routine to maximize resources efficiency at execution time. The performance of the proposed algorithm is evaluated by comparing the results with state of the art algorithms of this field, and the results indicate that the proposed algorithm has remarkable superiority in comparison to other algorithms and performs task scheduling with the least makespan and cost.

Keywords:  

Author(s) Name:  Amir Iranmanesh & Hamid Reza Naji

Journal name:  Cluster Computing

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s10586-020-03145-8

Volume Information:  volume 24, pages 667–681 (2021)