General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)


We study the problem of scheduling a set of n independent tasks on a fixed number of parallel processors, where the execution time of a task is a function of the subset of processors assigned to the task. We propose a fully polynomial approximation scheme that for any fixed > 0 finds a preemptive schedule of length at most (1 + ) times the optimum in O(n) time.We also discuss the non-preemptive variant of the problem, and present a polynomial approximation scheme that computes an approximate solution of any fixed accuracy in linear time. In terms of the running time, this linear complexity bound gives a substantial improvement of the best previously known polynomial bound [5].


Total Execution Time Total Processing Time Polynomial Time Approximation Scheme Preemptive Schedule Small Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th Annual European Symposium on Algorithms (1997), LNCS 1284, 1–12.Google Scholar
  2. 2.
    L. Bianco, J. Blazewicz, P. Dell Olmo and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58 (1995), 493–517.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    J. Blazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, C-35-5 (1986), 389–393.MathSciNetCrossRefGoogle Scholar
  4. 4.
    J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics, in press.Google Scholar
  5. 5.
    J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 418–427.Google Scholar
  6. 6.
    M. Drozdowski, Scheduling multiprocessor tasks-an overview, European Journal on Operations Research, 94 (1996), 215–230.zbMATHCrossRefGoogle Scholar
  7. 7.
    J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2 (1989), 473–487.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research 21 (1996), 321–340.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    J. A. Hoogeveen, S. L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259–272.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999), 490–498.Google Scholar
  11. 11.
    K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 408–417.Google Scholar
  12. 12.
    S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research 20 (1995), 257–301.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  1. 1.IDSIA LuganoLuganoSwitzerland
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations