Universiti Teknologi Malaysia Institutional Repository

Adaptive intelligent grid scheduling system

Lorpunmanee, Siriluck (2010) Adaptive intelligent grid scheduling system. PhD thesis, Universiti Teknologi Malaysia, Faculty of Computer Science and Information Systems.

[img] PDF
Restricted to Repository staff only

3833Kb
[img] PDF (Abstract)
66Kb
[img] PDF (Table of Contents)
256Kb
[img] PDF (1st Chapter)
155Kb

Abstract

Grid technologies are established to share the large-scale heterogeneous resources over multiple administrative domains for processing the application. In these technologies, the grid scheduling problem is crucial that must be solved in order to achieve multiple objectives within different stakeholders (end-users, owner resources and administrators) preferences. The aim of this research is to design and implement the Adaptive Intelligent Grid Scheduling System (AIGSS) in order to achieve multiple objectives named Makespan Time, Grid Efficiency and Total delayed jobs. The popular meta-heuristic algorithms, namely Ant Colony Optimization (ACO) and Tabu Search (TS) algorithms are proposed and developed to maintain the selecting appropriate grid resource to execute each job within the different job inter-arrival times and grid resources. Additionally, the clustering technique named Fuzzy C-Means (FCM) algorithm is proposed for clustering the groups of grid resources as well as jobs based on the degree of characteristic similarity. Moreover, a popular discrete event simulation tool, namely, GridSim toolkit and Alea simulation, is extended by developing the service modules on top of it. Therefore, the experiment is simulated as realistic grid environment in order to measure the proposed system. The experimental results show that the AIGSS provides reasonable multiple objectives to stakeholders within different job interarrival times and machines in grid system. In addition to the experimental results, the proposed system performs better than the other algorithms for different goals of each stakeholder. The performance of AIGSS is compared with the common and heuristic algorithms such as First-Come-First-Serve (FCFS) with Optimization, Earliest Deadline First (EDF), Minimum Tardiness Earliest Due Date (MTEDD), Minimum Completion Time (MCT), Opportunistic Load Balancing (OLB), MIN-MIN, Hill Climbing, EASY Backfilling, Simulated Annealing (SA), and Tabu Searching (TS).

Item Type:Thesis (PhD)
Additional Information:Thesis (Ph.D (Sains Komputer)) - Universiti Teknologi Malaysia, 2010 ; Supervisor : Prof. Dr. Abdul Hanan Abdullah
Uncontrolled Keywords:grid technologies, grid scheduling
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:18741
Deposited By: Kamariah Mohamed Jong
Deposited On:05 Apr 2012 08:53
Last Modified:27 Sep 2012 02:55

Repository Staff Only: item control page