Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Solving Task Scheduling Problem in Cloud Computing Environment Using Orthogonal Taguchi-Cat Algorithm

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 7 No. 3 (2017)

DOI
10.11591/ijece.v7i3.pp1489-1497
ISSN
2088-8708, 2088-8708
Published
2017-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

In cloud computing datacenter, task execution delay is no longer accidental. In recent times, a number of artificial intelligence scheduling techniques are proposed and applied to reduce task execution delay. In this study, we proposed an algorithm called Orthogonal Taguchi Based-Cat Swarm Optimization (OTB-CSO) to minimize total task execution time. In our proposed algorithm Taguchi Orthogonal approach was incorporated at CSO tracing mode for best task mapping on VMs with minimum execution time. The proposed algorithm was implemented on CloudSim tool and evaluated based on makespan metric. Experimental results showed for 20VMs used, proposed OTB-CSO was able to minimize makespan of total tasks scheduled across VMs with 42.86%, 34.57% and 2.58% improvement over Minimum and Maximum Job First (Min-Max ), Particle Swarm Optimization with Linear Descending Inertia Weight (PSO-LDIW) and Hybrid Particle Swarm Optimization with Simulated Annealing (HPSO-SA) algorithms. Results obtained showed OTB-CSO is effective to optimize task scheduling and improve overall cloud computing performance with better system utilization.

Collaboration network of the authors

13 authors · 31 co-authorship links · 23 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Technology Malaysia
  • Universiti Malaysia Pahang Al-Sultan Abdullah
  • Abdullahi Fodio University of Science and Technology
  • United Arab Emirates University
  • Tun Hussein Onn University of Malaysia
  • Universitas Ahmad Dahlan
  • Shaqra University
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Tole SutiknoUniversitas Ahmad Dahlan1
Shahreen binti KasimTun Hussein Onn University of Malaysia1
Mohd Arfian IsmailUniversiti Malaysia Pahang Al-Sultan Abdullah1
Nur Farahaina IdrisUniversiti Malaysia Pahang Al-Sultan Abdullah1
Mohd Saberi MohamadUnited Arab Emirates University1
Ahmad AlnawasrahAffiliation unknown1
Moaad AlmaniaShaqra University1
Fuad Abdulgaleel Abdoh GhalebBirmingham City University1
Mahmoud Al QeromUniversity of Bahrain1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Solving Task Scheduling Problem in Cloud Computing Environment Using Orthogonal Taguchi-Cat Algorithm</dc:title><dc:creator>Gabi, Danlami</dc:creator><dc:creator>Ismail, Abdul Samad</dc:creator><dc:creator>Zainal, Anazida</dc:creator><dc:creator>Zakaria, Zalmiyah</dc:creator><dc:description>&lt;jats:p&gt;In cloud computing datacenter, task execution delay is no longer accidental. In recent times, a number of artificial intelligence scheduling techniques are proposed and applied to reduce task execution delay. In this study, we proposed an algorithm called Orthogonal Taguchi Based-Cat Swarm Optimization (OTB-CSO) to minimize total task execution time. In our proposed algorithm Taguchi Orthogonal approach was incorporated at CSO tracing mode for best task mapping on VMs with minimum execution time. The proposed algorithm was implemented on CloudSim tool and evaluated based on makespan metric. Experimental results showed for 20VMs used, proposed OTB-CSO was able to minimize makespan of total tasks scheduled across VMs with 42.86%, 34.57% and 2.58% improvement over Minimum and Maximum Job First (Min-Max&amp;lt;em&amp;gt;)&amp;lt;/em&amp;gt;, Particle Swarm Optimization with Linear Descending Inertia Weight (PSO-LDIW) and Hybrid Particle Swarm Optimization with Simulated Annealing (HPSO-SA) algorithms. Results obtained showed OTB-CSO is effective to optimize task scheduling and improve overall cloud computing performance with better system utilization.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2017-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v7i3.pp1489-1497</dc:identifier><dc:identifier>10.11591/ijece.v7i3.pp1489-1497</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 7 No 3 (2017); 1489</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/7514/6565</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>