On Maximizing the Throughput of Multiprocessor Tasks

We consider the problem of scheduling n independent multiprocessor tasks with due dates and unit processing times, where the objective is to compute a schedule maximizing the throughput. We derive the complexity results and present several approximation algorithms. For the parallel variant of the problem, we introduce the first-fit increasing algorithm and the latest-fit increasing algorithm, and prove that their worst-case ratios are 2 and 2 - 1/m, respectively (m ? 2 is the number of processors). Then we propose a revised algorithm with worst-case ratio bounded by 3/2 - 1/(2m - 2) (m is even) and 3/2 - 1/(2m) (m is odd). For the dedicated variant, we present a simple greedy algorithm. We show that its worst-case ratio is bounded by ?m+1. We straighten this result by showing that the problem (even for a common due date D = 1) cannot be approximated within a factor of m1/2-? for any ? > 0, unless NP = ZPP.

[1]  Joseph Y.-T. Leung,et al.  Combinatorial analysis of an efficient algorithm for processor and storage allocation , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Eugene L. Lawler,et al.  Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .

[3]  Klaus Jansen,et al.  Scheduling to Minimize the Average Completion Time of Dedicated Tasks , 2000, FSTTCS.

[4]  Clyde L. Monma,et al.  Linear-Time Algorithms for Scheduling on Parallel Processors , 1982, Oper. Res..

[5]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[6]  Philip S. Yu,et al.  Scheduling parallel tasks to minimize average response time , 1994, SODA '94.

[7]  Ernst W. Mayr,et al.  On-Line Scheduling of Parallel Jobs with Runtime Restrictions , 1998, ISAAC.

[8]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[9]  Hans Kellerer,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 1999, RANDOM-APPROX.

[10]  Han Hoogeveen,et al.  On-line scheduling on a single machine: maximizing the number of early jobs , 2000, Oper. Res. Lett..

[11]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[12]  Stéphane Dauzère-Pérès,et al.  Minimizing late jobs in the general one machine scheduling problem , 1995 .

[13]  Philip S. Yu,et al.  Scheduling parallelizable tasks to minimize average response time , 1994, SPAA '94.

[14]  Errol L. Lloyd,et al.  Concurrent Task Systems , 1981, Oper. Res..

[15]  Anja Feldmann,et al.  Dynamic Scheduling on Parallel Machines , 1994, Theor. Comput. Sci..

[16]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[17]  Klaus Jansen,et al.  On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates , 2001, ICALP.

[18]  Chung-Lun Li,et al.  Minimizing total completion time in two‐processor task systems with prespecified processor allocations , 1998 .

[19]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

[21]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[22]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[23]  Joseph Y.-T. Leung,et al.  Bin packing: Maximizing the number of pieces packed , 2004, Acta Informatica.

[24]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[25]  Hans Kellerer,et al.  The Multiple Subset Sum Problem , 2000, SIAM J. Optim..

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

[27]  Evripidis Bampis,et al.  Scheduling Independent Multiprocessor Tasks , 1997, ESA.

[28]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .