Please use this identifier to cite or link to this item: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/12279
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbdulhamid, Shafi’i Muhammad-
dc.contributor.authorAbd Latiff, Muhammad Shafie-
dc.contributor.authorIsmaila, Idris-
dc.date.accessioned2021-08-02T19:57:05Z-
dc.date.available2021-08-02T19:57:05Z-
dc.date.issued2014-05-13-
dc.identifier.issn1819-6608-
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/12279-
dc.description.abstractMakespan 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.en_US
dc.language.isoenen_US
dc.publisherARPN Journal of Engineering and Applied Sciencesen_US
dc.relation.ispartofseries9(12), 2528 - 2533;-
dc.subjectleague championship algorithmen_US
dc.subjectoptimization algorithmen_US
dc.subjectjob scheduling algorithmen_US
dc.subjectIaaS clouden_US
dc.subjectcloud schedulingen_US
dc.subjectcloud computingen_US
dc.titleTasks Scheduling Technique Using League Championship Algorithm for Makespan Minimization in IaaS Clouden_US
dc.typeArticleen_US
Appears in Collections:Cyber Security Science

Files in This Item:
File Description SizeFormat 
36.pdfMakespan 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 cloud273.24 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.