A Comparison of Various Task Scheduling Algorithm Using Cloudsim

The term “cloud computing” refers to a large-scale, cost-effective distributed clustered computing paradigm in which users can access virtualize, platforms, manage scalable storage,computing power, and services as needed, via the internet. Through the use of hardware, systems software, and the internet, it offers applications as a service for data centres, that offer resources as a service. The job scheduling issue is a significant and challenging task in cloud computing. The primary goal of cloud computing service providers is to figure out how to utilise resources in the cloud effectively and earn profit as much as possible. High energy consumption results in significant operational costs, which lower cloud providers' profit margins, as well as high CO<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> emissions, which are unfriendly to the environment. Therefore, to reduce the negative effects of cloud computing on the environment, energy-efficient solutions are required. Because of this, the simulation tools are essential for both evaluating the functioning of the cloud and advancing cloud computing for the advancement of greener IT. The performance of the min-min, max-min, and suffrage scheduling algorithms are examined in this article, and CloudSim is used to provide a green approach for sustainable IT development.

Authors

Institutions

Publication Details

Published
2024-11-08
DOI
https://doi.org/10.1109/odicon62106.2024.10797467
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Comparison of Various Task Scheduling Algorithm Using Cloudsim

Binod Kumar Sahu, K. Murali Gopal, Padmaja Patel, N. Patel
Cloud Computing and Resource Management
article

A Comparison of Various Task Scheduling Algorithm Using Cloudsim

Binod Kumar Sahu, K. Murali Gopal, Padmaja Patel, N. Patel
article en

Abstract

The term “cloud computing” refers to a large-scale, cost-effective distributed clustered computing paradigm in which users can access virtualize, platforms, manage scalable storage,computing power, and services as needed, via the internet. Through the use of hardware, systems software, and the internet, it offers applications as a service for data centres, that offer resources as a service. The job scheduling issue is a significant and challenging task in cloud computing. The primary goal of cloud computing service providers is to figure out how to utilise resources in the cloud effectively and earn profit as much as possible. High energy consumption results in significant operational costs, which lower cloud providers' profit margins, as well as high CO<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> emissions, which are unfriendly to the environment. Therefore, to reduce the negative effects of cloud computing on the environment, energy-efficient solutions are required. Because of this, the simulation tools are essential for both evaluating the functioning of the cloud and advancing cloud computing for the advancement of greener IT. The performance of the min-min, max-min, and suffrage scheduling algorithms are examined in this article, and CloudSim is used to provide a green approach for sustainable IT development.

National Institute of Technology Sikkim (IN), Siksha O Anusandhan University (IN), GIET University (IN)
Openalex Percentile: Top 62%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.