Journal article Open Access

HAMM: A Hybrid Algorithm of Min-Min and Max-Min Task Scheduling Algorithms in Cloud Computing

Ibrahim A. Thiyeb; Dr. Sharaf A. Alhomdy

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Task Scheduling, Load Balancing, Heuristic Algorithms, Makespan, Max-Min, Min-Min, Resource Utilization</subfield>
  <controlfield tag="005">20220111134848.0</controlfield>
  <controlfield tag="001">5835354</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Associate Prof., IT Department, FCIT, Sana'a  University, Sana"a, Yemen</subfield>
    <subfield code="a">Dr. Sharaf A. Alhomdy</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Publisher</subfield>
    <subfield code="4">spn</subfield>
    <subfield code="a">Blue Eyes Intelligence Engineering  and Sciences Publication(BEIESP)</subfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">911994</subfield>
    <subfield code="z">md5:de2176f46da8d72f840ed355d9a5748e</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-11-30</subfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o"></subfield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="c">209-218</subfield>
    <subfield code="n">4</subfield>
    <subfield code="p">International Journal of Recent Technology and Engineering (IJRTE)</subfield>
    <subfield code="v">9</subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Postgraduate Student IT Department, FCIT, Sana'a  University, Sana"a, Yemen</subfield>
    <subfield code="a">Ibrahim A. Thiyeb</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">HAMM: A Hybrid Algorithm of Min-Min and  Max-Min Task Scheduling Algorithms in Cloud  Computing</subfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u"></subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">ISSN</subfield>
    <subfield code="0">(issn)2277-3878</subfield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">Retrieval Number</subfield>
    <subfield code="0">(handle)100.1/ijrte.D4874119420</subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Nowadays, with the huge development of information and computing technologies, the cloud computing is becoming the highly scalable and widely computing technology used in the world that bases on pay-per-use, remotely access, Internet-based and on-demand concepts in which providing customers with a shared of configurable resources. But, with the highly incoming user&amp;rsquo;s requests, the task scheduling and resource allocation are becoming major requirements for efficient and effective load balancing of a workload among cloud resources to enhance the overall cloud system performance. For these reasons, various types of task scheduling algorithms are introduced such as traditional, heuristic, and meta-heuristic. A heuristic task scheduling algorithms like MET, MCT, Min-Min, and Max-Min are playing an important role for solving the task scheduling problem. This paper proposes a new hybrid algorithm in cloud computing environment that based on two heuristic algorithms; Min-Min and Max-Min algorithms. To evaluate this algorithm, the Cloudsim simulator has been used with different optimization parameters; makespan, average of resource utilization, load balancing, average of waiting time and concurrent execution between small length tasks and long size tasks. The results show that the proposed algorithm is better than the two algorithms Min-Min and Max-Min for those parameters.&lt;/p&gt;</subfield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">issn</subfield>
    <subfield code="i">isCitedBy</subfield>
    <subfield code="a">2277-3878</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.35940/ijrte.D4874.119420</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
Views 30
Downloads 13
Data volume 11.9 MB
Unique views 27
Unique downloads 13


Cite as