An efficient symbiotic organisms search algorithm with chaotic optimization strategy for multi-objective task scheduling problems in cloud computing environment

• Main Authors: Abdullahi, Mohammed, Ngadi, Md. Asri, Dishing, Salihu Idi, Abdulhamid, Shafi'i Muhammad, Ahmad, Barroon Isma'eel
• Format: Article
• Published: Elsevier Ltd. 2019
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/87888/; http://dx.doi.org/10.1016/j.jnca.2019.02.005
• Institution: Universiti Teknologi Malaysia

In Cloud Computing model, users are charged according to the usage of resources and desired Quality of Service (QoS). Multi-objective task scheduling problem based on desired QoS is an NP-Complete problem. Due to the NP-Complete nature of task scheduling problems and huge search space presented by large scale problem instances, many of the existing solution algorithms cannot effectively obtain global optimum solutions. In this paper, a chaotic symbiotic organisms search (CMSOS) algorithm is proposed to solve multi-objective large scale task scheduling optimization problem on IaaS cloud computing environment. Chaotic optimization strategy is employed to generate initial ecosystem (population), and random sequence based components of the phases of SOS are replaced with chaotic sequence to ensure diversity among organisms for global convergence. In addition, chaotic local search strategy is applied to Pareto Fronts generated by SOS algorithms to avoid entrapment in local optima. The performance of the proposed CMSOS algorithm is evaluated on CloudSim simulator toolkit, using both standard workload traces and synthesized workloads for larger problem instances of up to 5000. Moreover, the performance of the proposed CMSOS algorithm was found to be competitive with the existing with the existing multi-objective task scheduling optimization algorithms. The CMSOS algorithm obtained significant improved optimal trade-offs between execution time (makespan) and financial cost (cost) with no computational overhead. Therefore, the proposed algorithms have potentials to improve the performance of QoS delivery.