A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution

In recent years, the concept of cloud computing has been gaining traction to provide dynamically increasing access to shared computing resources (software and hardware) via the internet. It’s no secret that cloud computing’s ability to supply mission-critical services has made job scheduling a hot s...

Full description

Saved in:

Bibliographic Details
Main Author:	Saydul Akbar, Murad
Format:	Thesis
Language:	English
Published:	2023
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://umpir.ump.edu.my/id/eprint/39291/1/ir.A%20new%20priority%20rule%20cloud%20scheduling%20technique%20that%20utilizes%20gaps%20to%20increase%20the%20efficiency%20of%20jobs%20distribution.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-ump-ir.39291
record_format	uketd_dc
spelling	my-ump-ir.392912023-11-14T04:00:53Z A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution 2023-07 Saydul Akbar, Murad QA75 Electronic computers. Computer science In recent years, the concept of cloud computing has been gaining traction to provide dynamically increasing access to shared computing resources (software and hardware) via the internet. It’s no secret that cloud computing’s ability to supply mission-critical services has made job scheduling a hot subject in the industry right now. However, the efficient utilization of these cloud resources has been a challenge, often resulting in wastage or degraded service performance due to poor scheduling. To solve this issue, existing research has been focused on queue-based job scheduling techniques, where jobs are scheduled based on specific deadlines or job lengths. 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, such as flowtime, makespan, and total tardiness. These are the limitations of the current implementation of existing Priority Rule (PR) schedulers, mainly caused by blocking made by jobs at the head of the queue. These limitations lead to the poor performance of cloud-based mobile applications and other cloud services. To address this issue, the main objective of this research is to improve the existing PR cloud schedulers by developing a new dynamic scheduling algorithm by manipulating the gaps in the cloud job schedule. In this thesis, first a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs get access to the required resources at optimal times. Then, a backfilling strategy called Shortest Gap Priority-Based Fair Scheduling (SG-PBFS) is proposed that attempts to manipulate the gaps in the schedule of cloud jobs. Finally, the performance evaluation demonstrates that the proposed SG-PBFS algorithm outperforms SG-SJF, SG-LJF, SG-FCFS, SG-EDF, and SG-(MAX-MIN) in terms of flow time, makespan time, and total tardiness, which conclusively demonstrates its effectiveness. The experiment result shows that for 500 jobs, SG-PBFS flow time, makespan time, and tardiness time are 9%, 4%, and 7% less than PBFS gradually. 2023-07 Thesis http://umpir.ump.edu.my/id/eprint/39291/ http://umpir.ump.edu.my/id/eprint/39291/1/ir.A%20new%20priority%20rule%20cloud%20scheduling%20technique%20that%20utilizes%20gaps%20to%20increase%20the%20efficiency%20of%20jobs%20distribution.pdf pdf en public masters Universiti Malaysia Pahang Faculty of Computing Zafril Rizal, M. Azmi
institution	Universiti Malaysia Pahang Al-Sultan Abdullah
collection	UMPSA Institutional Repository
language	English
advisor	Zafril Rizal, M. Azmi
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Saydul Akbar, Murad A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
description	In recent years, the concept of cloud computing has been gaining traction to provide dynamically increasing access to shared computing resources (software and hardware) via the internet. It’s no secret that cloud computing’s ability to supply mission-critical services has made job scheduling a hot subject in the industry right now. However, the efficient utilization of these cloud resources has been a challenge, often resulting in wastage or degraded service performance due to poor scheduling. To solve this issue, existing research has been focused on queue-based job scheduling techniques, where jobs are scheduled based on specific deadlines or job lengths. 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, such as flowtime, makespan, and total tardiness. These are the limitations of the current implementation of existing Priority Rule (PR) schedulers, mainly caused by blocking made by jobs at the head of the queue. These limitations lead to the poor performance of cloud-based mobile applications and other cloud services. To address this issue, the main objective of this research is to improve the existing PR cloud schedulers by developing a new dynamic scheduling algorithm by manipulating the gaps in the cloud job schedule. In this thesis, first a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs get access to the required resources at optimal times. Then, a backfilling strategy called Shortest Gap Priority-Based Fair Scheduling (SG-PBFS) is proposed that attempts to manipulate the gaps in the schedule of cloud jobs. Finally, the performance evaluation demonstrates that the proposed SG-PBFS algorithm outperforms SG-SJF, SG-LJF, SG-FCFS, SG-EDF, and SG-(MAX-MIN) in terms of flow time, makespan time, and total tardiness, which conclusively demonstrates its effectiveness. The experiment result shows that for 500 jobs, SG-PBFS flow time, makespan time, and tardiness time are 9%, 4%, and 7% less than PBFS gradually.
format	Thesis
qualification_level	Master's degree
author	Saydul Akbar, Murad
author_facet	Saydul Akbar, Murad
author_sort	Saydul Akbar, Murad
title	A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
title_short	A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
title_full	A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
title_fullStr	A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
title_full_unstemmed	A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
title_sort	new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
granting_institution	Universiti Malaysia Pahang
granting_department	Faculty of Computing
publishDate	2023
url	http://umpir.ump.edu.my/id/eprint/39291/1/ir.A%20new%20priority%20rule%20cloud%20scheduling%20technique%20that%20utilizes%20gaps%20to%20increase%20the%20efficiency%20of%20jobs%20distribution.pdf
_version_	1783732306146492416

A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution

Similar Items