Priority based fair scheduling : Enhancing efficiency in cloud job distribution

In recent years, there has been a growing interest in cloud computing as a means to enhance user access to shared computing resources, including software and hardware, through the internet. However, the efficient utilization of these cloud resources has been a challenge, often resulting in wastage o...

Full description

Saved in:
Bibliographic Details
Main Authors: Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Brishti, Faria Jerin, Saib, Md, Bairagi, Anupam Kumar
Format: Conference or Workshop Item
Language:English
English
Published: Institute of Electrical and Electronics Engineers Inc. 2023
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/40333/1/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud.pdf
http://umpir.ump.edu.my/id/eprint/40333/2/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud%20job%20distribution_ABS.pdf
http://umpir.ump.edu.my/id/eprint/40333/
https://doi.org/10.1109/ICSECS58457.2023.10256273
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ump.umpir.40333
record_format eprints
spelling my.ump.umpir.403332024-04-16T04:10:47Z http://umpir.ump.edu.my/id/eprint/40333/ Priority based fair scheduling : Enhancing efficiency in cloud job distribution Murad, Saydul Akbar Zafril Rizal, M. Azmi Brishti, Faria Jerin Saib, Md Bairagi, Anupam Kumar QA75 Electronic computers. Computer science QA76 Computer software T Technology (General) TA Engineering (General). Civil engineering (General) In recent years, there has been a growing interest in cloud computing as a means to enhance user access to shared computing resources, including software and hardware, through the internet. However, the efficient utilization of these cloud resources has been a challenge, often resulting in wastage or degraded service performance due to inadequate scheduling. To overcome this challenge, numerous researchers have focused on improving existing Priority Rule (PR) cloud schedulers by developing dynamic scheduling algorithms, but they have fallen short of meeting user satisfaction. In this study, we introduce a new PR scheduler called Priority Based Fair Scheduling (PBFS), which takes into account key parameters such as CPU Time, Job Arrival Time, and Job Length. We evaluate the performance of PBFS by comparing it with five existing algorithms, and the results demonstrate that PBFS surpasses the performance of the other algorithms. The experiment was conducted using the CloudSim simulator, utilizing a dataset of 300 and 400 jobs. In order to assess the performance, three key metrics were employed: flow time, makespan time, and total tardiness. These metrics were chosen to evaluate and analyze the effectiveness of the proposed scheduling algorithm. Institute of Electrical and Electronics Engineers Inc. 2023 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/40333/1/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud.pdf pdf en http://umpir.ump.edu.my/id/eprint/40333/2/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud%20job%20distribution_ABS.pdf Murad, Saydul Akbar and Zafril Rizal, M. Azmi and Brishti, Faria Jerin and Saib, Md and Bairagi, Anupam Kumar (2023) Priority based fair scheduling : Enhancing efficiency in cloud job distribution. In: 8th International Conference on Software Engineering and Computer Systems, ICSECS 2023 , 25-27 August 2023 , Penang. pp. 170-175. (192961). ISBN 979-835031093-1 https://doi.org/10.1109/ICSECS58457.2023.10256273
institution Universiti Malaysia Pahang Al-Sultan Abdullah
building UMPSA Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Pahang Al-Sultan Abdullah
content_source UMPSA Institutional Repository
url_provider http://umpir.ump.edu.my/
language English
English
topic QA75 Electronic computers. Computer science
QA76 Computer software
T Technology (General)
TA Engineering (General). Civil engineering (General)
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
T Technology (General)
TA Engineering (General). Civil engineering (General)
Murad, Saydul Akbar
Zafril Rizal, M. Azmi
Brishti, Faria Jerin
Saib, Md
Bairagi, Anupam Kumar
Priority based fair scheduling : Enhancing efficiency in cloud job distribution
description In recent years, there has been a growing interest in cloud computing as a means to enhance user access to shared computing resources, including software and hardware, through the internet. However, the efficient utilization of these cloud resources has been a challenge, often resulting in wastage or degraded service performance due to inadequate scheduling. To overcome this challenge, numerous researchers have focused on improving existing Priority Rule (PR) cloud schedulers by developing dynamic scheduling algorithms, but they have fallen short of meeting user satisfaction. In this study, we introduce a new PR scheduler called Priority Based Fair Scheduling (PBFS), which takes into account key parameters such as CPU Time, Job Arrival Time, and Job Length. We evaluate the performance of PBFS by comparing it with five existing algorithms, and the results demonstrate that PBFS surpasses the performance of the other algorithms. The experiment was conducted using the CloudSim simulator, utilizing a dataset of 300 and 400 jobs. In order to assess the performance, three key metrics were employed: flow time, makespan time, and total tardiness. These metrics were chosen to evaluate and analyze the effectiveness of the proposed scheduling algorithm.
format Conference or Workshop Item
author Murad, Saydul Akbar
Zafril Rizal, M. Azmi
Brishti, Faria Jerin
Saib, Md
Bairagi, Anupam Kumar
author_facet Murad, Saydul Akbar
Zafril Rizal, M. Azmi
Brishti, Faria Jerin
Saib, Md
Bairagi, Anupam Kumar
author_sort Murad, Saydul Akbar
title Priority based fair scheduling : Enhancing efficiency in cloud job distribution
title_short Priority based fair scheduling : Enhancing efficiency in cloud job distribution
title_full Priority based fair scheduling : Enhancing efficiency in cloud job distribution
title_fullStr Priority based fair scheduling : Enhancing efficiency in cloud job distribution
title_full_unstemmed Priority based fair scheduling : Enhancing efficiency in cloud job distribution
title_sort priority based fair scheduling : enhancing efficiency in cloud job distribution
publisher Institute of Electrical and Electronics Engineers Inc.
publishDate 2023
url http://umpir.ump.edu.my/id/eprint/40333/1/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud.pdf
http://umpir.ump.edu.my/id/eprint/40333/2/Priority%20based%20fair%20scheduling_Enhancing%20efficiency%20in%20cloud%20job%20distribution_ABS.pdf
http://umpir.ump.edu.my/id/eprint/40333/
https://doi.org/10.1109/ICSECS58457.2023.10256273
_version_ 1822924222769397760
score 13.234172