By Topic

A Modified Simulated Annealing Algorithm for Static Task Scheduling in Grid Computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kazem, A. ; Islamic Azad Univ., Tabriz ; Rahmani, A.M. ; Aghdam, H.H.

Grid Computing aims to allow unified access to data, computing power, sensors and other resources through a single virtual laboratory. The development or adaptation of applications for Grid environments is being challenged by the need of scheduling a large number of tasks and resources efficiently. The general problem of optimally mapping tasks to machines in a heterogeneous computing suite has been shown to be NP-complete. In this paper we propose a modified simulated annealing algorithm for scheduling independent tasks in Grid environment. Experimental results show that our proposed algorithm improves the performance of static instances compared to the results of other algorithms reported in the literature.

Published in:

Computer Science and Information Technology, 2008. ICCSIT '08. International Conference on

Date of Conference:

Aug. 29 2008-Sept. 2 2008