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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf |
| _version_ | 1825834810591936512 |
|---|---|
| author | Kheoh, Hooi Leng |
| author_facet | Kheoh, Hooi Leng |
| author_sort | Kheoh, Hooi Leng |
| collection | USM |
| 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%. |
| first_indexed | 2024-03-06T15:28:17Z |
| format | Thesis |
| id | usm.eprints-43533 |
| institution | Universiti Sains Malaysia |
| language | English |
| last_indexed | 2024-03-06T15:28:17Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | usm.eprints-435332019-04-12T05:26:16Z http://eprints.usm.my/43533/ Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling 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 NonPeerReviewed application/pdf en http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf Kheoh, Hooi Leng (2013) Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling. Masters thesis, Universiti Sains Malaysia. |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Kheoh, Hooi Leng Fairness Categorization Policy Of Queuing Theory For Geographic Information System Job Scheduling |
| title | 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_short | 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 |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://eprints.usm.my/43533/1/Kheoh%20Hooi%20Leng24.pdf |
| work_keys_str_mv | AT kheohhooileng fairnesscategorizationpolicyofqueuingtheoryforgeographicinformationsystemjobscheduling |