2009 International Joint Conference on Computational Sciences and Optimization Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Sanya, Hainan, China April 24-April 26 ISBN: 978-0-7695-3605-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSO.2009.487
Scheduling is one of the core steps to efficientlyexploit the capabilities of heterogeneous distributedcomputing systems and is an NP-complete problem.Therefore using meta-heuristic algorithms is asuitable approach in order to cope with its difficulty.In meta-heuristic algorithms, generating individualsin the initial step has an important effect on theconvergence behavior of the algorithm and finalsolutions. Using some heuristics for generating one ormore near-optimal individuals in the initial step canimprove the final solutions obtained by meta-heuristicalgorithms. Different criteria can be used forevaluating the efficiency of scheduling algorithms, themost important of which are makespan and flowtime.In this paper we propose an efficient heuristic methodand then we will compare with five popular heuristicsfor minimizing makespan and flowtime inheterogeneous distributed computing systems.
Index Terms:
grid scheduling, artificial intelligence, nature inspired heuristics
Citation:
Hesam Izakian, Ajith Abraham, Václav Snášel, "Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments," cso, vol. 1, pp.8-12, 2009 International Joint Conference on Computational Sciences and Optimization, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb