By Topic

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

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)
Izakian, H. ; Islamic Azad Univ., Ramsar, Iran ; Abraham, A. ; Snasel, V.

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and is an NP-complete problem. Therefore using meta-heuristic algorithms is a suitable approach in order to cope with its difficulty. In meta-heuristic algorithms, generating individuals in the initial step has an important effect on the convergence behavior of the algorithm and final solutions. Using some heuristics for generating one or more near-optimal individuals in the initial step can improve the final solutions obtained by meta-heuristic algorithms. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan and flowtime.In this paper we propose an efficient heuristic method and then we will compare with five popular heuristics for minimizing makespan and flowtime in heterogeneous distributed computing systems.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009