Task assignment scheduling by simulated annealing
Resource
TENCON 90. 1990 IEEE Region 10 Conference on Computer and Communication Systems
Journal
TENCON 90
Journal Issue
10
Pages
-
Date Issued
1990-09
Date
1990-09
Author(s)
Lin, Feng-Tse
Hsu, Ching-Chi
DOI
N/A
Abstract
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.>
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00152616.pdf
Size
470.28 KB
Format
Adobe PDF
Checksum
(MD5):00e896e748b525bc4154be211866f555