Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling

Geographic Information System (GIS) is a compute-intensive plus data-intensive application that deals with substantial amount of spatial data processing and rendering of three-dimensional (3D) images of the locations. Besides research work on data or image processing part of GIS applications, schedu...

Full description

Saved in:
Bibliographic Details
Main Author: Kheoh, Hooi Leng
Format: Thesis
Language:English
Published: 2013
Subjects:
Online Access:http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-usm-ep.43533
record_format uketd_dc
spelling my-usm-ep.435332019-04-12T05:26:16Z Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling 2013-05 Kheoh, Hooi Leng QA75.5-76.95 Electronic computers. Computer science Geographic Information System (GIS) is a compute-intensive plus data-intensive application that deals with substantial amount of spatial data processing and rendering of three-dimensional (3D) images of the locations. Besides research work on data or image processing part of GIS applications, scheduling of GIS workload can be further studied to improve the performance of GIS applications. In this regards, this thesis proposes an algorithm of job scheduler named Fair Categorized Queue Scheduling (FCQS) which distributes jobs of GIS applications efficiently. Queuing theory is applied in FCQS for job scheduling processes meanwhile the GIS job arrivals are distributed according to Poisson distribution. Each category of jobs is served along with First-Come First-Served (FCFS) basic using the Multiple Queues Multiple Machines (MQMM) configuration. The experiment through simulation has been carried out to evaluate the performance of FCQS and other queue configurations such as Single Queue Single / Multiple Machine(s) (SQSM / SQMM) and Multiple Queues Single / Multiple Machines(s) (MQSM / MQMM). The results proved that the FCQS algorithm achieved the highest throughput with 24 jobs or 72.727% more than the lowest throughput of SQSM. Additionally, the total Input / Output (IO) transferring time can be reduced up to 49.194% by using multiple jobs processing compared to single job processing within small jobs, attaining lower average turnaround time and waiting time simultaneously. Last but not least, the optimization of grid resources has been significantly improved by decreasing total pending jobs to 28.261% instead of the highest 52.174%. 2013-05 Thesis http://eprints.usm.my/43533/ http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf application/pdf en public masters Universiti Sains Malaysia Pusat Pengajian Sains Komputer
institution Universiti Sains Malaysia
collection USM Institutional Repository
language English
topic QA75.5-76.95 Electronic computers
Computer science
spellingShingle QA75.5-76.95 Electronic computers
Computer science
Kheoh, Hooi Leng
Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
description Geographic Information System (GIS) is a compute-intensive plus data-intensive application that deals with substantial amount of spatial data processing and rendering of three-dimensional (3D) images of the locations. Besides research work on data or image processing part of GIS applications, scheduling of GIS workload can be further studied to improve the performance of GIS applications. In this regards, this thesis proposes an algorithm of job scheduler named Fair Categorized Queue Scheduling (FCQS) which distributes jobs of GIS applications efficiently. Queuing theory is applied in FCQS for job scheduling processes meanwhile the GIS job arrivals are distributed according to Poisson distribution. Each category of jobs is served along with First-Come First-Served (FCFS) basic using the Multiple Queues Multiple Machines (MQMM) configuration. The experiment through simulation has been carried out to evaluate the performance of FCQS and other queue configurations such as Single Queue Single / Multiple Machine(s) (SQSM / SQMM) and Multiple Queues Single / Multiple Machines(s) (MQSM / MQMM). The results proved that the FCQS algorithm achieved the highest throughput with 24 jobs or 72.727% more than the lowest throughput of SQSM. Additionally, the total Input / Output (IO) transferring time can be reduced up to 49.194% by using multiple jobs processing compared to single job processing within small jobs, attaining lower average turnaround time and waiting time simultaneously. Last but not least, the optimization of grid resources has been significantly improved by decreasing total pending jobs to 28.261% instead of the highest 52.174%.
format Thesis
qualification_level Master's degree
author Kheoh, Hooi Leng
author_facet Kheoh, Hooi Leng
author_sort Kheoh, Hooi Leng
title Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
title_short Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
title_full Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
title_fullStr Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
title_full_unstemmed Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling
title_sort fairness categorization policy of queuing theory for geographic information system job scheduling
granting_institution Universiti Sains Malaysia
granting_department Pusat Pengajian Sains Komputer
publishDate 2013
url http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf
_version_ 1747821235176210432