Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Architectures and Languages Europe

PARLE 1993: PARLE '93 Parallel Architectures and Languages Europe pp 464–475Cite as

Task scheduling with restricted preemptions

  • Paper Sessions
  • Conference paper
  • First Online:

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

Abstract

One of the basic problems in time sharing systems and multiprocessing operating systems is to find an optimal schedule for a given set of tasks. In this paper we analyze the complexity of a restricted version of the general preemptive scheduling problem. We introduce a scheduling model that guarantees that preemption of a task is only possible after a reasonable part of the task has been processed. It turns out that this problem is NP-hard in general, but very good approximation algorithms can be found and special cases can be solved exactly in polynomial time.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Błażewicz, K. Ecker, G. Schmidt, J. W474-01glarz, Scheduling in Computer and Manufacturing Systems, Springer-Verlag, 1993.

    Google Scholar 

  2. K. R. Baker, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints, Oper. Res. 31, 1983, 381–386.

    Google Scholar 

  3. J. Błażewicz, J. K. Lenstra, A. H. G. Rinnooy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5, 1983, 11–24.

    Google Scholar 

  4. S. K. Baruah, L. E. Rosier, R. R. Howell, Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor, Real-Time Systems 2, 1990, 301–324.

    Google Scholar 

  5. E. G. Coffman, Jr., M. R. Garey, Proof of the 4/3 conjecture for preemptive versus nonpreemptive two-processor scheduling, Report Bell Laboratories, Murray Hill, 1991.

    Google Scholar 

  6. Y. Cho, S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Oper. Res. 29, 1981, 511–522.

    Google Scholar 

  7. A. Federgruen, H. Groenevelt, Preemptive scheduling of uniform machines by ordinary network flow techniques, Management Sci. 32, 1986, 341–349.

    Google Scholar 

  8. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  9. T. Gonzalez, S. Sahni, Preemptive scheduling of uniform processor systems, JACM 25, 1978, 92–101.

    Google Scholar 

  10. E. C. Horvath, S. Lam, R. Sethi, A level algorithm for preemptive scheduling, JACM 24, 24, 1977, 32–43.

    Google Scholar 

  11. T. C. Hu, Parallel sequencing and assembly line problems, Oper. Res. 9, 1961, 841–848.

    Google Scholar 

  12. R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, 85–104.

    Google Scholar 

  13. E. L. Lawler, Preemptive scheduling in precedence-constrained jobs on parallel machines, in: M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.), Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, 101–123.

    Google Scholar 

  14. E. L. Lawler, J. Labetoulle, Preemptive scheduling of unrelated parallel processors by linear programing, J. Assoc. Comput. Mach. 25, 1978, 612–619.

    Google Scholar 

  15. J. Labetoulle, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W. R. Pulleyblank (ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984, 245–261.

    Google Scholar 

  16. R. Muntz, E. G. Coffman, Jr., Optimal preemptive scheduling on two-processor systems, IEEE Trans. Comput. C-18, 1969, 1014–1029.

    Google Scholar 

  17. R. R. Muntz, E. G. Coffman, Preemptive scheduling of real-time tasks on multiprocessor systems, JACM 17, 1970, 324–338.

    Google Scholar 

  18. S. Sahni, Preemptive scheduling with due dates, Oper. Res. 5, 1979, 925–934.

    Google Scholar 

  19. R. Słowinski, Scheduling preemptible tasks on unrelated processors with additional resources to mionimize schedule length, in G. Bracci, R. C. Lockemann (eds.), Lecture Notes in Computer Science, vol 65, Springer Verlag, Berlin, 1978, 536–547.

    Google Scholar 

  20. D. de Werra, Preemptive scheduling linear programming and network flows, SIAM Journal Algebra and Discrete Mathematics 5, 1984, 11–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, TU Clausthal, Erzstr. 1, 3392, Clausthal, Germany

    K. Ecker

  2. Gesellschaft für Systemtechnik mbH, Pdv-Systeme, Bornhardtstr. 3, 3380, Goslar, Germany

    R. Hirschberg

Authors
  1. K. Ecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Hirschberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ecker, K., Hirschberg, R. (1993). Task scheduling with restricted preemptions. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation