MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization

In order to fully utilize the Grid resources, implementing a good scheduling algorithm is really important. Currently, some of the well-known researches and enterprise schedulers have applied Priority Rule (PR) schedulers to manage the Grid jobs because they are simple and easy to implement. To date...

Full description

Bibliographic Details
Main Authors:	Zafril Rizal, M Azmi, Imran Edzereiq, Kamarudin, Ngahzaifa, Ab. Ghani
Format:	Article
Language:	English
Published:	Publishing Technology 2018
Subjects:	HG Finance QA Mathematics
Online Access:	http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/1/MTTDFR-SJFR%20-%20A%20Combinatorial%20Rule%20Approach%20To%20Balance%20Tradeoff%20Between%20Flowtime%2C%20Makespan%2C%20Delayed%20Jobs%2C%20Total%20Tardiness%20And%20Utilization.pdf

id	ump-19604
recordtype	eprints
spelling	ump-196042018-11-12T04:09:21Z http://umpir.ump.edu.my/id/eprint/19604/ MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization Zafril Rizal, M Azmi Imran Edzereiq, Kamarudin Ngahzaifa, Ab. Ghani HG Finance QA Mathematics In order to fully utilize the Grid resources, implementing a good scheduling algorithm is really important. Currently, some of the well-known researches and enterprise schedulers have applied Priority Rule (PR) schedulers to manage the Grid jobs because they are simple and easy to implement. To date, there is no strong performance justification or proof given on why these specific PR algorithms are preferred compared to other PR algorithms. For example, five PR algorithms; First Come First Serve (FCFS), Longest Job First (LJF), Shortest Job First (SJF), Earliest Deadline First (EDF) and Minimum Time To Deadline (MTTD) have been proposed. However, none of these algorithms perform well in every metrics of performance. An attempt to improve their performance has been made using Combinatorial Rule (CR) which is the combination of more than one PR. Unfortunately, the current implementation of CR only focuses on two performance metrics which are flowtime and makespan, while sacrificing the others. In order to tackle the aforementioned problem, this paper introduces Minimum Time To Deadline to Fastest Resource - Shortest Job to Fastest Resource (MTTDFR-SJFR), a new CR scheduler that performs better than other CR algorithms tested within the scope. To achieve high performance, a combination of PR with Fastest Resource (FR) resource selection scheme that further improve the performance is proposed. Graphical results obtained from experimental simulation showed the superiority of the proposed CR algorithm in term of overall performance, compared to other CR as well as the original PR. Publishing Technology 2018-11 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/19604/1/MTTDFR-SJFR%20-%20A%20Combinatorial%20Rule%20Approach%20To%20Balance%20Tradeoff%20Between%20Flowtime%2C%20Makespan%2C%20Delayed%20Jobs%2C%20Total%20Tardiness%20And%20Utilization.pdf Zafril Rizal, M Azmi and Imran Edzereiq, Kamarudin and Ngahzaifa, Ab. Ghani (2018) MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization. Advanced Science Letters, 24 (10). pp. 7339-7347. ISSN 1936-6612 https://doi.org/10.1166/asl.2018.12939 DOI: 10.1166/asl.2018.12939
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	HG Finance QA Mathematics
spellingShingle	HG Finance QA Mathematics Zafril Rizal, M Azmi Imran Edzereiq, Kamarudin Ngahzaifa, Ab. Ghani MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
description	In order to fully utilize the Grid resources, implementing a good scheduling algorithm is really important. Currently, some of the well-known researches and enterprise schedulers have applied Priority Rule (PR) schedulers to manage the Grid jobs because they are simple and easy to implement. To date, there is no strong performance justification or proof given on why these specific PR algorithms are preferred compared to other PR algorithms. For example, five PR algorithms; First Come First Serve (FCFS), Longest Job First (LJF), Shortest Job First (SJF), Earliest Deadline First (EDF) and Minimum Time To Deadline (MTTD) have been proposed. However, none of these algorithms perform well in every metrics of performance. An attempt to improve their performance has been made using Combinatorial Rule (CR) which is the combination of more than one PR. Unfortunately, the current implementation of CR only focuses on two performance metrics which are flowtime and makespan, while sacrificing the others. In order to tackle the aforementioned problem, this paper introduces Minimum Time To Deadline to Fastest Resource - Shortest Job to Fastest Resource (MTTDFR-SJFR), a new CR scheduler that performs better than other CR algorithms tested within the scope. To achieve high performance, a combination of PR with Fastest Resource (FR) resource selection scheme that further improve the performance is proposed. Graphical results obtained from experimental simulation showed the superiority of the proposed CR algorithm in term of overall performance, compared to other CR as well as the original PR.
format	Article
author	Zafril Rizal, M Azmi Imran Edzereiq, Kamarudin Ngahzaifa, Ab. Ghani
author_facet	Zafril Rizal, M Azmi Imran Edzereiq, Kamarudin Ngahzaifa, Ab. Ghani
author_sort	Zafril Rizal, M Azmi
title	MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
title_short	MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
title_full	MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
title_fullStr	MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
title_full_unstemmed	MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization
title_sort	mttdfr-sjfr: a combinatorial rule approach to balance tradeoff between flowtime, makespan, delayed jobs, total tardiness and utilization
publisher	Publishing Technology
publishDate	2018
url	http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/ http://umpir.ump.edu.my/id/eprint/19604/1/MTTDFR-SJFR%20-%20A%20Combinatorial%20Rule%20Approach%20To%20Balance%20Tradeoff%20Between%20Flowtime%2C%20Makespan%2C%20Delayed%20Jobs%2C%20Total%20Tardiness%20And%20Utilization.pdf
first_indexed	2023-09-18T22:28:02Z
last_indexed	2023-09-18T22:28:02Z
_version_	1777416098542518272

MTTDFR-SJFR: A Combinatorial Rule Approach To Balance Tradeoff Between Flowtime, Makespan, Delayed Jobs, Total Tardiness And Utilization

Similar Items