Scheduling Multiprocessor Tasks to Minimize Schedule Length

The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedule length is studied. First we concentrate on the problem of nonpreemptive scheduling. In this case, polynomial-time algorithms exist only for unit processing times. We present two such algorithms of complexity O(n) for scheduling tasks requiring an arbitrary number of processors between 1 and k at a time where k is a fixed integer. The case for which k is not fixed is shown to be NP-complete. Next, the problem of preemptive scheduling of tasks of arbitrary length is studied. First an algorithm for scheduling tasks requiring one or k processors is presented. Its complexity depends linearly on the number of tasks. Then, the possibility of a linear programming formulation for the general case is analyzed.

[1]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[4]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[5]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[6]  Wojciech Cellary,et al.  Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] , 1977, TOMS.

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

[8]  A. Avizienis,et al.  Fault-tolerance: The survival attribute of digital systems , 1978, Proceedings of the IEEE.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[11]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[12]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[13]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

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

[15]  Jan Karel Lenstra,et al.  Scheduling theory since 1981: an annotated bibliography , 1983 .

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

[17]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[18]  J. Baewicz,et al.  A linear time algorithm for restricted bin packing and scheduling problems , 1983 .

[19]  Jacek Blazewicz,et al.  Scheduling Independent 2-Processor Tasks to Minimize Schedule Length , 1984, Inf. Process. Lett..