Home navigate_next Journals navigate_next ITEMA navigate_next Vol. 1, No. 1navigate_next A Novel Job Scheduler for Computational Grid Using Simulated Annealing Heuristic
ICSES Transactions on Evolutionary and Metaheuristic Algorithms
Vol. 1, No. 1, Nov. 2015


A Novel Job Scheduler for Computational Grid Using Simulated Annealing Heuristic

Original Paper
1.2k
Visits
517
Downloads
Hamid Saadi a,mail_outline, AbdolHamid MomenZadeh b, Ehsan PourAliAkbar c, et al. d
a Masjed-Soleiman Branch, Islamic Azad University (I.A.U), Masjed-Soleiman, Iran
b Masjed-Soleiman Branch, Islamic Azad University (I.A.U), Masjed-Soleiman, Iran
c Masjed-Soleiman Branch, Islamic Azad University (I.A.U), Masjed-Soleiman, Iran
d Refer to the Manuscript for Other Authors, Addresses, and Affiliations

 

Highlights and Novelties
No Highlights!

 

Manuscript Abstract
Computational Grids enable the coordinated and aggregated use of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. Achieving high performance in a grid system requires effective resource scheduling. The heterogeneous and dynamic nature of the grid, as well as the differing demands of applications running on the grid makes grid scheduling complicated. Also, the execution cost, besides the completion time, has become the great concern to the grid users. Many of grid scheduling systems optimize completion time and execution cost separately. In this paper, a novel scheduling algorithm based on simulated annealing heuristic which considers both the completion time and execution cost is introduced. The proposed model applies a weighted objective function that takes into account both the completion time and execution cost of the tasks. The results obtained from our algorithm have been compared with several algorithms such as random, best of N random and climb search algorithm according to the criteria of completion time and execution cost. We show that the proposed SA scheduler produces a comparatively better result in the case of both time and cost optimization.

 

Keywords
 Computational grid   scheduling   Optimization   simulated annealing. 

 

Copyright and Licence
© Copyright was transferred to International Computer Science and Engineering Society (ICSES) by all the Authors.This manuscript is published in Open-Access manner based on the copyright licence of Creative Commons Attribution Non Commercial 4.0 International (CC BY-NC 4.0).

 

Cite this manuscript as
Hamid Saadi, AbdolHamid MomenZadeh, Ehsan PourAliAkbar, et al., "A Novel Job Scheduler for Computational Grid Using Simulated Annealing Heuristic," ICSES Transactions on Evolutionary and Metaheuristic Algorithms (ITEMA), vol. 1, no. 1, pp. 6-13, Nov. 2015.

 

For External Scientific Databeses
--BibTex-- --EndNote-- --Dublin--
Purchase and Access

lock_open Open-Access

Bibliography

Manuscript ID: 8
Pages: 6-13
Submitted: 2015-10-01
Accepted: 2015-11-29
Published: 2015-11-30


Cited By (0)
Journal's Title
ITEMA Cover Page

Journal

ICSES Transactions on Evolutionary and Metaheuristic Algorithms
ISSN: 2467-291X

ISSN: 2467-291X
Frequency: Quarterly
Accessability: Online - Open Access (till 2020)
Founded in: Mar. 2015
Publisher: ICSES
DOI Suffix: 10.31424/icses.itema