By Topic

A Dynamic Simulated Annealing Algorithm with Self-adaptive Technique for Grid Scheduling

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

5 Author(s)
Xiaohong Kong ; Henan Inst. of Sci. & Technol., Xinxiang, China ; Xiqu Chen ; Wei Zhang ; Guanjun Liu
more authors

Due to the availability of the excess computation power, the heterogeneous grid systems have significant predominance in higher performance and low cost. In this paper, a self-adaptive algorithm is proposed based on Simulated Annealing (SA) for grid scheduling to minimize the make span, in response to the grid dynamic characteristic. During the process of scheduling, partial scheduling information is exploited to decide the next partial scheduling parameters set, which is self-adaptive to the stochastic job arrival time. We simulated the algorithm in GridSim environment, and the simulation results demonstrated that the proposed algorithm improved performance compared to existing scheduling techniques.

Published in:

Intelligent Systems, 2009. GCIS '09. WRI Global Congress on  (Volume:1 )

Date of Conference:

19-21 May 2009