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...

Full description

Bibliographic Details

Main Author:	Nanda, Ashwini K. (Ashwini Kumar)
Other Authors:	Stenger, Daniel L.
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:	Multiprocessors. Combinatorial optimization.