Zobrazit v EDS

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

Uloženo v:
Podrobná bibliografie
Název: Use of Enhanced Greedy Algorithm for Load Balancing in Cloud Computing.
Autoři: Osman, Hanaa, Hammo, Asma'a Yassin, Ahmad, Abdulnasir Younus
Zdroj: Pertanika Journal of Science & Technology; Jan2024, Vol. 32 Issue 1, p113-125, 13p
Témata: GREEDY algorithms, VIRTUAL machine systems, CLOUD computing, PRODUCTION scheduling, ALGORITHMS
Abstrakt: 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.)
Databáze: Complementary Index
Popis
Abstrakt: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]
ISSN:01287680
DOI:10.47836/pjst.32.1.07