By Topic

An efficient optimization technique for task matching and scheduling 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

2 Author(s)
Po-Jen Chuang ; Dept. of Electr. Eng., Tamkang Univ., Taipei Hsien, Taiwan ; Chia-Hsin Wei

A new optimization technique, the genetic annealing algorithm (GAA), is proposed to solve the task matching and scheduling problem in a heterogeneous computing system. The GAA is simple in design; it employs only the stir operation, a novel idea with the annealing concept, to locate optimal solutions. Experimental evaluation shows that compared with the genetic algorithm, simulated annealing and guided evolutionary simulated annealing approaches, the GAA yields constantly favorable performance in terms of speedup, running time, cost and complexity.

Published in:

Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on

Date of Conference:

17-20 Dec. 2002