By Topic

Simulated Annealing Algorithm for Independent Tasks Assignment in Heterogeneous Computing Systems

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
$33 $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

4 Author(s)
RongYing Cai ; FuJian Agriculture and Forestry University, China ; ZhengYuan Ning ; LiShan Li ; YiWen Zhong

Efficient tasks assignment is critical for achieving high performance in heterogeneous computing systems (HCS). The tasks assignment problem is NP-hard in general. In order to obtain better solutions, many assignment heuristics have been presented in the literature. Simulated Annealing (SA) algorithm is a powerful stochastic search method. It has been successfully used in many discrete optimization problems, such as TSP, JSP, and QAP, etc. After analyzing the impact of SA's neighborhood on its performance, this paper defines two neighborhood structures first, then it presents a SA algorithm to tackle independent tasks assignment problem in HCS. The simulation results show that after using a suitable neighborhood system, SA algorithm is effective for independent tasks assignment problem in HCS.

Published in:

Third International Conference on Natural Computation (ICNC 2007)  (Volume:5 )

Date of Conference:

24-27 Aug. 2007