TITLE

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors

AUTHOR(S)
Bianco, L.; Blazewicz, J.; Dell'Olmo, P.; Drozdowski, M.
PUB. DATE
June 1995
SOURCE
Annals of Operations Research;1995, Vol. 58 Issue 1-4, p493
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In the classical scheduling theory, it is widely assumed that a task can be processed by only one processor at a time. With the rapid development of technology, this assumption is no longer valid. In this work we present a problem of scheduling tasks, each of which requires for its processing a set of processors simultaneously and which can be executed on several alternative sets of processors. Scheduling algorithms based on dynamic and linear programming are presented that construct minimum length non-preemptive and preemptive schedules, respectively. Results of computational experiments are also reported.
ACCESSION #
18651774

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics