Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2000: Algorithms and Computation pp 398–409Cite as

Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1969))

Abstract

We study the problem of scheduling a set of n independent parallel tasks on m processors, where in addition to the processing time there is a size associated with each task indicating that the task can be processed on any subset of processors of the given size. Based on a linear programming formulation, we propose an algorithm for computing a preemptive schedule with minimum makespan, and show that the running time of the algorithm depends polynomially on m and only linearly on n. Thus for any fixed m, an optimal preemptive schedule can be computed in O(n) time. We also present extensions of this approach to other (more general) scheduling problems with malleable tasks, release times, due dates and maximum lateness minimization.

Supported in part by CEC, Project APPOL, IST-1999-14084.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th European Symposium on Algorithms (1997), LNCS 1284, 1–12.

    Google Scholar 

  2. A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, manuscript of an extended version of [1], submitted to Algorithmica, 1998.

    Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Blazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, C-35-5; (1986), 389–393.

    Article  MathSciNet  Google Scholar 

  5. J. Blazewicz, M. Drozdowski, D. de Werra and J. Weglarz, Deadline scheduling of multiprocessor tasks, Discrete Applied Mathematics 65 (1996), 81–96.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 418–427.

    Google Scholar 

  7. M. Drozdowski, On the complexity of multiprocessor task scheduling, Bulletin of the Polish Academy of Sciences, 43 (1995), 381–392.

    MATH  Google Scholar 

  8. M. Drozdowski, Scheduling multiprocessor tasks — an overview, European Journal on Operations Research, 94 (1996), 215–230.

    Article  MATH  Google Scholar 

  9. J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2 (1989), 473–487.

    Article  MATH  MathSciNet  Google Scholar 

  10. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57 (1998), 187–199.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Feldmann, J. Sgall and S.H. Teng, Dynamic scheduling on parallel machines, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (1991), 111–120.

    Google Scholar 

  12. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, 1988.

    Google Scholar 

  13. 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.

    Article  MATH  MathSciNet  Google Scholar 

  14. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (1999), 490–498.

    Google Scholar 

  15. K. Jansen and L. Porkolab, Preemptive scheduling on dedicated processors: applications of fractional graph coloring, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, Springer Verlag.

    Google Scholar 

  16. C. Kenyon and E. Remila, Approximate strip packing, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (1996), 31–36.

    Google Scholar 

  17. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (1994), 167–176.

    Google Scholar 

  18. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of ACM, 41 (1994), 960–981.

    Article  MATH  MathSciNet  Google Scholar 

  19. G. Schmidt, Scheduling on semi-identical processors, Zeitschrift für Oper. Res. 28 (1984), 153–162.

    Article  MATH  Google Scholar 

  20. G. Schmidt, Scheduling with limited machine availability, International Computer Science Institute Technical Report TR-98-036, Berkeley, California, October 1998.

    Google Scholar 

  21. U. Schwiegelshohn, Preemptive weighted completion time scheduling of parallel jobs, Proceedings of the 4th European Symposium of Algorithms (1996), LNCS 1136, 39–51.

    Google Scholar 

  22. A. Steinberg, A strip-packing algorithm with absolute performance bound two, SIAM Journal on Computing 26 (1997), 401–409.

    Article  MATH  MathSciNet  Google Scholar 

  23. J. Turek, J. Wolf and P. Yu, Approximate algorithms for scheduling parallelizable tasks, Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (1992), 323–332.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und praktische Mathematik, Christian Albrechts University of Kiel, Germany

    Klaus Jansen

  2. Department of Computing, Imperial College, London, UK

    Lorant Porkolab

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lorant Porkolab
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansen, K., Porkolab, L. (2000). Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation