Makespan minimization in tasks scheduling of infrastructure as a service (IaaS) cloud is an NP-hard problem. A number of techniques had been used in the past to optimize the makespan time of scheduled tasks in IaaS cloud, which is propotional to the execution cost billed to customers. In this paper, we proposed a League Championship Algorithm (LCA) based makespan time minimization scheduling technique in IaaS cloud. The LCA is a sports-inspired population based algorithmic framework for global optimization over a continuous search space. Three other existing algorithms that is, First Come First Served (FCFS), Last Job First (LJF) and Best Effort First (BEF) were used to evaluate the performance of the proposed algorithm. All algorithms under consideration assumed to be non-preemptive. The results obtained shows that, the LCA scheduling technique perform moderately better than the other algorithms in minimizing the makespan time of scheduled tasks in IaaS cloud. Keywords: League Championship Algorithm; IaaS Cloud, Job Scheduling Algorithm, Cloud Computing, Cloud Scheduling, Optimization Algorithm. In 2009, Kashan [1] introduced a novel computational intelligence algorithm called the league championship algorithm (LCA). It is a novel optimization technique designed based on the inspiration of soccer competitions in a championship league. The new algorithm is a population based algorithmic scheme for global optimization over a continuous search space. The LCA was designed to be a stochastic population based algorithm for continuous global optimization which tries to mimic a championship situation where synthetic football clubs participate in an artificial league for a period of time. The LCA algorithm has been used in many areas and performed creditably well as compared to other known optimization schemes or heuristics algorithms [2, 3] . The cloud computing services can be largely divided into three; the software as a service (SaaS), the platform as a service (PaaS) and the infrastructure as a service (IaaS). The IaaS cloud provides computational resources such as the virtual machines (VMs) to cloud users on demand [4, 5] . Tasks scheduling optimization had been an area of research in IaaS cloud because it is an NP-hard problem. Nevertheless, the autonomous attribute and the resource heterogeneity within the clouds and the VM execution necessitate different schemes for task scheduling in the IaaS cloud computing to be used and tested in order to minimize the makespan time. The makespan time is directly responsible for the tasks execution cost in this environment [6, 7] . The main objective of this research paper is to propose a tasks scheduling technique in IaaS cloud computing using the LCA, to minimize the makespan. Section II reviewes some related literatures in LCA and also in tasks scheduling in IaaS cloud. Section III puts describes the materials and proposed method from tasks scheduling in environment by enhancing the LCA add-on of winner/looser determination. Section IV presents the experiment setup and results and section V presents the conclusion and future works.
To minimize the makespan of tasks scheduling in IaaS cloud, Abdulhamid, et al. REF use a League Championship Algorithm (LCA) for the purpose of efficient tasks scheduling in IaaS cloud computing system.
Tasks Scheduling Technique Using League Championship Algorithm for Makespan Minimization in IaaS Cloud
ARPN Journal of Engineering and Applied Sciences 9 (12), 2528 - 2533 (2014)
Computer Science