Genetic Algorithms for Job Scheduling in Cloud Computing

Abstract : Efficient job scheduling algorithms needed to improve the resource utilization in cloud computing, the role of a good scheduling algorithm on cloud computing is to minimize the total completion time for last job on the system. In this paper, we present a genetic-based task scheduling algorithms in order to minimize Maximum Completion Time Makespan. These algorithms combines different techniques such as list scheduling and earliest completion time (ECT) with genetic algorithm. We reviewed, evaluated and compared the proposed algorithms against one of the well-known Genetic Algorithms available in the literature, which has been proposed for task scheduling problem on heterogeneous computing systems. After an exhaustive computational analysis we identify that the proposed Genetic algorithms show a good performance overcoming the evaluated method in different problem sizes and complexity for a large benchmark set of instances.
Document type :
Journal articles
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01783624
Contributor : Lcoms Ul <>
Submitted on : Wednesday, May 2, 2018 - 3:23:21 PM
Last modification on : Thursday, February 7, 2019 - 4:54:42 PM

Links full text

Identifiers

Collections

Citation

Mohammed-Albarra Hassan, Imed Kacem, Sébastien Martin, Izzeldin Osman. Genetic Algorithms for Job Scheduling in Cloud Computing. Studies in Informatics and Control, Informatics and Control Publications, 2015, 24 (4), ⟨10.24846/v24i4y201503⟩. ⟨hal-01783624⟩

Share

Metrics

Record views

61