Skip to main content
Springer Nature Link
Log in

Optimal scheduling for two-processor systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Despite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processors. In this paper we formulate a general model of computation structures and exhibit an efficient algorithm for finding optimal nonpreemptive schedules for these structures on two-processor systems. We prove that the algorithm gives optimal solutions and discuss its application to preemptive scheduling disciplines.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Fulkerson, D. R.: Scheduling in project networks. Proc. IBM Scientific Computing Symposium on Combinatorial Problems. New York: IBM Corporation 1966.

    Google Scholar 

  2. Clark, W.: The Gantt chart (3rd Edition). London: Pitman and Sons 1952.

    Google Scholar 

  3. Hu, T. C.: Parallel sequencing and assembly line problems. Operations Research 9, No. 6 (Nov. 1961).

  4. Muntz, R. R., Coffman, E. G., Jr.: Optimal preemptive scheduling on twoprocessor systems. IEEE Trans. on Computers C 18, No. 11, 1014–1020, Nov. 1969.

    Google Scholar 

  5. - Scheduling of computations on multiprocessor systems: The preemptive assignment discipline. PhD. Thesis, Electrical Eng. Dept., Princeton University, April 1969.

  6. Graham, R. L.: Bounds for certain multiprocessing anomalies. BSTJ, Nov. 1966, pp. 1563–1581.

  7. — Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, No.2, 416–429 (1969).

    Google Scholar 

  8. Fujii, M., Kasami, T., Ninomiya, K.: Optimal sequence of two equivalent processors. SIAM J. Appl. Math. 17, No. 3, 784–789 (1969).

    Google Scholar 

  9. — Erratum. SIAM J. Appl. Math. 20, No. 1, 141 (1971).

    Google Scholar 

  10. Edmonds, J.: Paths, trees and flowers. Canad. J. Math. 17, 449–467 (1965).

    Google Scholar 

  11. Lawler, E. L. (personal communication).

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Pennsylvania State University, 16802, University Park, Penn., USA

    E. G. Coffman Jr.

  2. Bell Telephone Laboratories, Inc., Murray Hill, New Jersey, USA

    R. L. Graham

Authors
  1. E. G. Coffman Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. L. Graham
    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

Coffman, E.G., Graham, R.L. Optimal scheduling for two-processor systems. Acta Informatica 1, 200–213 (1972). https://doi.org/10.1007/BF00288685

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation