Skip to main content
SpringerLink
Log in

Kritischer Vergleich von Algorithmen für ein Scheduling-Problem

  • Betriebsysteme II
  • Conference paper
  • First Online:
GI — 5. Jahrestagung (GI 1975)

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

Included in the following conference series:

  • 1978 Accesses

Abstract

In this paper we are concerned with algorithms producing schedules for processes which consist of a finite set of tasks and a precedence relation between them. For executing tasks a system of m identical processors is available. We are interested in algorithms producing non preemptive schedules which are nearly time-optimal. For some well-known algorithms the lengths of their schedules are compared with the lengths of time-minimal schedules. A new algorithm which produces considerably better schedules is presented and discussed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Chen, N.F. and C.L. Liu: On a class of scheduling algorithms for multiprocessing computing systems, Proceedings of the Sagamore Computer Conference on Parallel Processing 1974. Lecture Notes in Computer Science 24, 1–16 (1975).

    Google Scholar 

  2. Coffman, E.G., Jr., and P.J. Denning: Operating systems theory, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1973.

    Google Scholar 

  3. Coffman, E.G., Jr., and R.L. Graham: Optimal scheduling for two-processor systems, Acta Informatica 1, 200–213 (1972).

    Google Scholar 

  4. Hu, T.C.: Parallel sequencing and assembly line problems, Opns. Res. 9, 841–848 (1961).

    Google Scholar 

  5. Johnson, D.S,: Approximation algorithms for combinatorial problems, Proceedings of the 5th Annual Symposium on Theory of Complexity, Austin, Texas, 38–49 (1973).

    Google Scholar 

  6. Krone, M.: Heuristic programming applied to scheduling problems, Ph.D. thesis, Dept. of Electrical Engineering, Princeton Univ., Princeton, N.J. (1970).

    Google Scholar 

  7. Ullman, J.D.: NP-complete scheduling problems, Journal of Computer and System Sciences 10, 384–393 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung, 5205, St. Augustin, BRD

    K. Ecker

Authors
  1. K. Ecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Mülbacher

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ecker, K. (1975). Kritischer Vergleich von Algorithmen für ein Scheduling-Problem. In: Mülbacher, J. (eds) GI — 5. Jahrestagung. GI 1975. Lecture Notes in Computer Science, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07410-4_670

Download citation

  • DOI: https://doi.org/10.1007/3-540-07410-4_670

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07410-6

  • Online ISBN: 978-3-540-37929-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation