Simulated annealing algorithms for scheduling directed task graphs on multiprocessors /
Abstract: "Scheduling task graphs on multiprocessors is a well known combinatorial problem. In the presence of intertask communication, the scheduling problem becomes even more difficult. In recent years, simulated annealing methods have become popular as an effective means of solving cobmina...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1991]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
91-040. |
| Subjects: |
| Summary: | Abstract: "Scheduling task graphs on multiprocessors is a well known combinatorial problem. In the presence of intertask communication, the scheduling problem becomes even more difficult. In recent years, simulated annealing methods have become popular as an effective means of solving cobminatorial [sic] optimization problems. In this paper we present two scheduling algorithms based on simulated annealing and study their performance. The first algorithm presented is somewhat superior to the second one in terms of the schedule length it gives. But the second algorithm is superior to the first in terms of algorithm run time." |
|---|---|
| Item Description: | "August 1991." |
| Physical Description: | 20 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |