By Topic

Adaptive algorithm for task scheduling in the distributed heterogeneous systems using harmony search

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)
Heydari, F. ; Electr. Eng. Dept., Iran Univ. of Sci. & Technol., Tehran, Iran ; Shahriar Shahhoseini, H.

Task scheduling for a heterogeneous distributed system is one of the most important problems that affects the system performance. We propose an adaptive harmony search algorithm called AHS that has not need to exactly tune the initialization parameters while has high convergence speed. The algorithm adjusts the parameters adaptively and linearly. Moreover, we are presented a method improvise the new solution. This method seeks the best experience of each musician. If experience is repeated several times and it reaches to the good results, it will perform again. Simulation results with random graph and real application graph show that AHS outperforms the mostly used algorithms, IHS and NGHS algorithms.

Published in:

Networked Computing (INC), 2011 The 7th International Conference on

Date of Conference:

26-28 Sept. 2011