Skip to main content
SpringerLink
Log in

Improved 0/1-interchange scheduling

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Consideration is given to the problem of nonpreemptively scheduling a set ofN independent tasks to a system ofM identical processors, with the objective to minimize the overall finish time. It is proved that the 0/1-INTERCHANGE scheduling heuristic can be modified, without increasing its time complexity fromO(N logM), so that its worst-case performance bound is reduced from 2 to 4/3 times optimal.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, London, 1974.

    Google Scholar 

  2. E. G. Coffman, M. R. Garey and D. S. Johnson,An application of bin-packing to multiprocessor scheduling, SIAM Journal on Computing 7 (1978), 1–17.

    Google Scholar 

  3. G. Finn and E. Horowitz,A linear time approximation algorithm for multiprocessor scheduling, BIT 19 (1979), 312–320.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979.

    Google Scholar 

  5. R. L. Graham,Bounds on multiprocessor timing anomalies, SIAM Journal on Applied Mathematics 17 (1969), 416–429.

    Google Scholar 

  6. M. A. Langston,Processor scheduling with improved heuristic algorithms, Doctoral Dissertation, Texas A&M University, College Station, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Washington State University, 99164, Pullman, WA, USA

    Michael A. Langston

Authors
  1. Michael A. Langston
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Langston, M.A. Improved 0/1-interchange scheduling. BIT 22, 282–290 (1982). https://doi.org/10.1007/BF01934441

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934441

Keywords

Search

Navigation