Preemptive multiprocessor task scheduling with release times and time windows
L. Bianco,
J. Blazewicz,
P. Dell'Olmo and
M. Drozdowski
Annals of Operations Research, 1997, vol. 70, issue 0, 43-55
Abstract:
Classical scheduling theory assumed that a task may require for its processing only one processor at a time. This assumption is not obvious in the context of new parallel computer systems and parallel algorithms. In this work, we consider preemptive deterministic scheduling of multiprocessor tasks, each of which may require a set of processors at a time. In general, tasks may appear in the system in different moments of time. We will also consider the problem of scheduling such tasks in time windows on particular processors. The existence of low-order polynomial time algorithms for the above problems with C max and L max criteria will be analyzed. The general case of the problem can be solved using a linear programming approach. Copyright Kluwer Academic Publishers 1997
Keywords: Parallel processing; multiprocessor tasks; preemptive scheduling; release times; scheduling in time windows; polynomial time algorithms (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018994726051 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:70:y:1997:i:0:p:43-55:10.1023/a:1018994726051
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018994726051
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().