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.
SCHEDULING MULTIPROCESSOR TASKS ON A DYNAMIC CONFIGURATION OF DEDICATED PROCESSORS / L., Bianco; J., Blazewicz; Dell'Olmo, Paolo; M., Drozdowski. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - STAMPA. - 58:7(1995), pp. 493-517. (Intervento presentato al convegno Symposium on Applied Mathematical Programming and Modelling II (APMOD93) tenutosi a BUDAPEST, HUNGARY nel JAN, 1993) [10.1007/bf02057160].
SCHEDULING MULTIPROCESSOR TASKS ON A DYNAMIC CONFIGURATION OF DEDICATED PROCESSORS
DELL'OLMO, Paolo;
1995
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
