Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors

Abstract In the classical scheduling theory it is widely assumed that any task requires for its processing only one processor at a time. In this paper the problem of deterministic scheduling of tasks requiring for their processing more than one processor at a time, i.e., a constant set of dedicated processors, is analyzed. Schedule length is assumed to be a performance measure. Tasks are assumed to be preemptable and independent. Low order polynomial algorithms for simple cases of the problem are given. Then a method to solve the general version of the problem for a limited number of processors is presented, while the case of an arbitrary number of processors is known to be NP-hard. Finally, a version of the problem, where besides processors every task can also require additional resources, is considered.

[1]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[2]  Daniel P. Siewiorek,et al.  Parallel processing: the Cm* experience , 1986 .

[3]  Günter Schmidt,et al.  Scheduling independent two processor tasks on a uniform duo-processor system , 1990, Discret. Appl. Math..

[4]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6]  M. Dal Cin,et al.  On the diagnosability of self-testing multi-microprocessor systems☆ , 1981 .

[7]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[8]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..

[9]  Marek Kubale,et al.  The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors , 1987, Information Processing Letters.

[10]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[11]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[12]  D. de Werra,et al.  Preemptive Scheduling, Linear Programming and Network Flows , 1984 .

[13]  B. J. Lageweg,et al.  Multiprocessor scheduling with communication delays , 1990, Parallel Comput..

[14]  Bozoki George,et al.  A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem , 1970 .