Achieving of Tabu Search Algorithm for Scheduling Technique in Grid Computing Using GridSim Simulation Tool: Multiple Jobs on Limited Resource

Yusof, Mohd Kamir (2010) Achieving of Tabu Search Algorithm for Scheduling Technique in Grid Computing Using GridSim Simulation Tool: Multiple Jobs on Limited Resource. International Journal of Grid and Distributed Computing, 3 (4). pp. 19-32. ISSN 2005-4262

[img] Text
2 (2).pdf - Published Version
Restricted to Registered users only

Download (541Kb)
Official URL: http://www.sersc.org/journals/IJGDC/

Abstract

Grid computing is a form of distributed computing involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographically dispersed organization. One of the scheduling techniques in Grid Computing is Tabu Search algorithm. A good scheduling algorithm is normally shows lower value of total tardiness and schedule time. The implementation Tabu Search algorithm was tested and evaluated on universal datasets using GridSim tool. The results indicate performance of tardiness is directly related to number of machines up to certain number of resources. Small and medium company can use grid in operation process because it saves cost and times

Item Type: Article
Keywords: Grid Computing, Grid Scheduling, GridSim, Multiple Jobs, Tabu Search
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Institute: Faculty of Informatics & Computing
Depositing User: Mr. Mohd Kamir Yusof
Date Deposited: 26 May 2014 07:29
Last Modified: 26 May 2014 07:29
URI: http://erep.unisza.edu.my/id/eprint/1060

Actions (login required)

View Item View Item