Skip to main content
SpringerLink
Log in

On a class of scheduling algorithms for multiprocessors computing systems

  • Session 1: Scheduling 1
  • Conference paper
  • First Online:
Parallel Processing (SCC 1974)

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

Included in the following conference series:

Abstract

In this paper we study a class of scheduling algorithms for multiprocessors computing systems which we call level algorithms. These algorithms are simple and easy to implement. They produce optimal schedules in some cases, and produce close-to-optimal schedules in other cases. Sufficient conditions under which schedules produced by the level algorithms will be optimal are obtained. For the sub-optimal schedules, we are able to compare quantitatively their performance against that of an optimal schedule.

Research supported by NSF GJ-41538.

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.

References

  1. E.G. Coffman, Jr., and R.L. Graham, "Optimal scheduling for two-processor systems," Acta Informatia 2 1972, pp. 200–213.

    Google Scholar 

  2. J. Edmonds, "Paths, trees and flowers," Can. Jour. of Math 17 1965, pp. 449–467.

    Google Scholar 

  3. M. Fujii, T. Kasami, and K. Ninomiya, "Optimal sequencing of two equivalent processors," SIAM Jour. of App. Math 17 No. 3 1969, pp. 784–789.

    Google Scholar 

  4. R.L. Graham, "Bounds on multiprocessing timing anomalies," SIAM Jour. of App. Math 17 No. 2 1969, pp. 416–429.

    Google Scholar 

  5. T.C. Hu, "Parallel sequencing and assembly line problems," Oper. Res. 9 No. 6 1961, pp. 841–848.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Illinois, 61801, Urbana, Illinois

    N. F. Chen

  2. Department of Computer Science, University of Illinois, 61801, Urbana, Illinois

    C. L. Liu

Authors
  1. N. F. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. L. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tse-yun Feng

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, N.F., Liu, C.L. (1975). On a class of scheduling algorithms for multiprocessors computing systems. In: Feng, Ty. (eds) Parallel Processing. SCC 1974. Lecture Notes in Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07135-0_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-07135-0_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07135-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation