By Topic

Task assignment scheduling by simulated annealing

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)
Feng-Tse Lin ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ching-Chi Hsu

A stochastic, heuristic search algorithm called simulated annealing is considered for the problem of static task assignment scheduling in distributed computing systems. The purpose of task assignment scheduling is to assign modules of programs over a set of interconnected processors in order to reduce the job turnaround time as well as to obtain the best system performance. It is shown that the approach of simulated annealing, with a properly designed annealing schedule and a good move generation strategy can be used to solve this problem in an efficient way

Published in:

Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on

Date of Conference:

24-27 Sep 1990