By Topic

On Simulated Annealing for the Scheduling of Parallel Applications

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

2 Author(s)
De Mello, R.F. ; Dept. de Comput., Univ. de Sao Paulo, Sao Carlos ; Senger, L.J.

A grid scheduling algorithm inspired on the simulated annealing meta-heuristic (SA) is presented. Guided by predictions about parallel applications resource usage, the algorithm uses SA to find a near-optimal solution which minimizes the overall execution time for scheduling problems on heterogeneous grids. The scheduling algorithm invalidated by simulations, using a model which considers the mainly details about the distributed computers and the jobs,and is compared with other scheduling algorithms. The results allows identify the best SA parameters values, that are the learning rate and the iteration size, for each grid size. We found good results when simulating the scheduling algorithm for grid sizes near by 512 computers. We also observed that the SA computing cost do not jeopardize the scheduling results, which are better when compared with the performance of other scheduling disciplines.

Published in:

Computer Architecture and High Performance Computing, 2008. SBAC-PAD '08. 20th International Symposium on

Date of Conference:

Oct. 29 2008-Nov. 1 2008