Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors |
| |
Authors: | L. Bianco J. Blazewicz P. Dell'Olmo M. Drozdowski |
| |
Affiliation: | (1) Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy;(2) Instytut Informatyki Politechniki Poznaskiej, Pozna, Poland |
| |
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.This research was partially supported by a KBN grant and by project CRIT. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|