Scheduling multiprocessor tasks on parallel processors with limited availability

In this work we consider the problem of scheduling multiprocessor tasks on parallel processors available only in restricted intervals of time called time windows. The multiprocessor task model applies to modern production systems and parallel applications in which several processors can be utilized...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2003-09, Vol.149 (2), p.377-389
Main Authors: Błażewicz, Jacek, Dell’Olmo, Paolo, Drozdowski, Maciej, Mączka, Przemysław
Format: Article
Language:English
Subjects:
Bandwidth allocation
Co-scheduling
Gang scheduling
Mathematical models
Multiprocessing
Multiprocessor tasks
Parallel computing
Parallel processing
Parallel tasks
Production scheduling
Scheduling
Studies
Time windows
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we consider the problem of scheduling multiprocessor tasks on parallel processors available only in restricted intervals of time called time windows. The multiprocessor task model applies to modern production systems and parallel applications in which several processors can be utilized in parallel. Preemptable tasks are considered. Polynomial time algorithms are given in three cases: the case of maximum lateness criterion and a fixed number of processors, the case of schedule length criterion when tasks have various ready times and require either one or all processors, and in case of schedule length criterion when the sizes of the tasks are powers of 2.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(02)00760-9