1. An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments
- Author
-
Morshed U. Chowdhury, Fangmin Li, Zhou Zhou, Houliang Xie, Jemal H. Abawajy, and Huaxi Zhu
- Subjects
0209 industrial biotechnology ,Computer science ,business.industry ,Quality of service ,Distributed computing ,Cloud computing ,Workload ,02 engineering and technology ,Scheduling (computing) ,020901 industrial engineering & automation ,Artificial Intelligence ,Genetic algorithm ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business ,Software - Abstract
Cloud computing is an emerging distributed system that provides flexible and dynamically scalable computing resources for use at low cost. Task scheduling in cloud computing environment is one of the main problems that need to be addressed in order to improve system performance and increase cloud consumer satisfaction. Although there are many task scheduling algorithms, existing approaches mainly focus on minimizing the total completion time while ignoring workload balancing. Moreover, managing the quality of service (QoS) of the existing approaches still needs to be improved. In this paper, we propose a novel algorithm named MGGS (modified genetic algorithm (GA) combined with greedy strategy). The proposed algorithm leverages the modified GA algorithm combined with greedy strategy to optimize task scheduling process. Different from existing algorithms, MGGS can find an optimal solution using fewer number of iterations. To evaluate the performance of MGGS, we compared the performance of the proposed algorithm with several existing algorithms based on the total completion time, average response time, and QoS parameters. The results obtained from the experiments show that MGGS performs well as compared to other task scheduling algorithms.
- Published
- 2019
- Full Text
- View/download PDF