Skip to main content
SpringerLink
Log in

A linear time approximation algorithm for multiprocessor scheduling

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Givenn jobs andm identical processors anO(n) approximation algorithm is presented which tries to determine a nonpreemptive schedule with minimum finish time. Ifr is the number of jobs placed onto the processor with maximum finish time, then the worst case ratio of the new algorithm's finish time to the optimal solution is shown to be less thanrm/(rm−m+1). Extensive empirical results show that the new algorithm is competitive with the LPT algorithm in terms of quality of solution and faster in terms of computing time.

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. E. G. Coffman, M. R. Garey, and D. S. Johnson,An application of bin-packing to multiprocessor scheduling, SIAM J. Comput., vol. 7, no. 1, Feb. 1978, 1–17.

    Article  Google Scholar 

  2. E. G. Coffman and Ravi Sethi,A generalized bound on LPT scheduling, Revue française d'automatique informatique recherche operationelle, vol. 10, no. 5, May 1976, pp. 17–25.

    Google Scholar 

  3. E. G. Coffman, ed.,Computer and job/shop scheduling theory, John Wiley, New York, 1976.

    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 multiprocessing timing anomalies, SIAM J. Appl. Math. 17 (1969), pp. 416–429.

    Article  Google Scholar 

  6. E. Horowitz and S. Sahni,Fundamentals of data structures, Computer Science Press, Potomac Md. 1976.

    Google Scholar 

  7. E. Horowitz and S. Sahni,Fundamentals of computer algorithms. Computer Science Press, Potomac Md. 1978.

    Google Scholar 

  8. J. D. Ullman,Complexity of sequencing problems, Computer and Job/shop scheduling theory, E. G. Coffman, ed. John Wiley, New York, 1976, Chap. 4.

    Google Scholar 

  9. J. H. Ahrens and U. Dieter,A combinatorial method for the generation of normally distributed random numbers, Math. Comp., vol. 27, Oct. 1973, 927–937.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Southern California, 90007, Los Angeles, CA, U.S.A.

    Greg Finn & Ellis Horowitz

Authors
  1. Greg Finn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ellis Horowitz
    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

Finn, G., Horowitz, E. A linear time approximation algorithm for multiprocessor scheduling. BIT 19, 312–320 (1979). https://doi.org/10.1007/BF01930985

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation