In EDS ansehen

Use of Enhanced Greedy Algorithm for Load Balancing in Cloud Computing.

Gespeichert in:
Bibliographische Detailangaben
Titel: Use of Enhanced Greedy Algorithm for Load Balancing in Cloud Computing.
Autoren: Osman, Hanaa, Hammo, Asma'a Yassin, Ahmad, Abdulnasir Younus
Quelle: Pertanika Journal of Science & Technology; Jan2024, Vol. 32 Issue 1, p113-125, 13p
Schlagwörter: GREEDY algorithms, VIRTUAL machine systems, CLOUD computing, PRODUCTION scheduling, ALGORITHMS
Abstract: Because of the Internet's phenomenal growth in recent years, computing resources are now more widely available. It led to the development of a new computing concept known as Cloud Computing, allowing users to share resources such as networks, servers, storage, applications, services, software, and data across multiple devices on demand for economical and fast. Load balancing is an important branch of cloud computing as it optimizes machine utilization by distributing tasks equally over resources. It occurs among physical hosts or Virtual Machines in a cloud environment. Round robin is a commonly used algorithm in load balancing. RR gives a time quantum for each task and is in circular order. It is noted that it suffers from many problems, such as the waste of time and the high cost. In the present study, the greedy algorithm was enhanced and implemented to allocate and schedule tasks that come to the cloud on Virtual Machines in balance. The task with the longest execution time is given to the virtual machine with the least load using an improved greedy algorithm. The outcomes demonstrate that the suggested algorithm outperformed round robin in makespan. Also, all Virtual Machines in the proposed algorithm finish their work simultaneously, whereas round robin is unbalanced. [ABSTRACT FROM AUTHOR]
Copyright of Pertanika Journal of Science & Technology is the property of Universiti Putra Malaysia and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=01287680&ISBN=&volume=32&issue=1&date=20240101&spage=113&pages=113-125&title=Pertanika Journal of Science & Technology&atitle=Use%20of%20Enhanced%20Greedy%20Algorithm%20for%20Load%20Balancing%20in%20Cloud%20Computing.&aulast=Osman%2C%20Hanaa&id=DOI:10.47836/pjst.32.1.07
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Osman%20H
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 175536533
RelevancyScore: 966
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 965.693359375
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Use of Enhanced Greedy Algorithm for Load Balancing in Cloud Computing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Osman%2C+Hanaa%22">Osman, Hanaa</searchLink><br /><searchLink fieldCode="AR" term="%22Hammo%2C+Asma'a+Yassin%22">Hammo, Asma'a Yassin</searchLink><br /><searchLink fieldCode="AR" term="%22Ahmad%2C+Abdulnasir+Younus%22">Ahmad, Abdulnasir Younus</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Pertanika Journal of Science & Technology; Jan2024, Vol. 32 Issue 1, p113-125, 13p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22GREEDY+algorithms%22">GREEDY algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22VIRTUAL+machine+systems%22">VIRTUAL machine systems</searchLink><br /><searchLink fieldCode="DE" term="%22CLOUD+computing%22">CLOUD computing</searchLink><br /><searchLink fieldCode="DE" term="%22PRODUCTION+scheduling%22">PRODUCTION scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22ALGORITHMS%22">ALGORITHMS</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Because of the Internet's phenomenal growth in recent years, computing resources are now more widely available. It led to the development of a new computing concept known as Cloud Computing, allowing users to share resources such as networks, servers, storage, applications, services, software, and data across multiple devices on demand for economical and fast. Load balancing is an important branch of cloud computing as it optimizes machine utilization by distributing tasks equally over resources. It occurs among physical hosts or Virtual Machines in a cloud environment. Round robin is a commonly used algorithm in load balancing. RR gives a time quantum for each task and is in circular order. It is noted that it suffers from many problems, such as the waste of time and the high cost. In the present study, the greedy algorithm was enhanced and implemented to allocate and schedule tasks that come to the cloud on Virtual Machines in balance. The task with the longest execution time is given to the virtual machine with the least load using an improved greedy algorithm. The outcomes demonstrate that the suggested algorithm outperformed round robin in makespan. Also, all Virtual Machines in the proposed algorithm finish their work simultaneously, whereas round robin is unbalanced. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Pertanika Journal of Science & Technology is the property of Universiti Putra Malaysia and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=175536533
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.47836/pjst.32.1.07
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 113
    Subjects:
      – SubjectFull: GREEDY algorithms
        Type: general
      – SubjectFull: VIRTUAL machine systems
        Type: general
      – SubjectFull: CLOUD computing
        Type: general
      – SubjectFull: PRODUCTION scheduling
        Type: general
      – SubjectFull: ALGORITHMS
        Type: general
    Titles:
      – TitleFull: Use of Enhanced Greedy Algorithm for Load Balancing in Cloud Computing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Osman, Hanaa
      – PersonEntity:
          Name:
            NameFull: Hammo, Asma'a Yassin
      – PersonEntity:
          Name:
            NameFull: Ahmad, Abdulnasir Younus
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 01287680
          Numbering:
            – Type: volume
              Value: 32
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Pertanika Journal of Science & Technology
              Type: main
ResultId 1