Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Scheduling loops on parallel processors: A simple algorithm with close to optimum performance

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

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

  • 150 Accesses

Abstract

This paper addresses the NP-hard problem of scheduling a cyclic set of interdependent operations, representing a program loop, when a finite number of identical processors are available. We give a simple and efficient algorithm producing close to optimum results. As a side result our algorithm guarantees optimality when the number of processors is infinite.

This article was processed using the LaTEX macro package with LLNCS style

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.

Similar content being viewed by others

References

  1. E. G. Coffman, Computer and Job-shop Scheduling Theory, John Wiley and Sons, New York, New York, 1976.

    Google Scholar 

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

    Google Scholar 

  3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press and Mc Graw Hill, 1990.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson, Computers and Intractability — A Guide to the Theory of NP-Completeness, Freeman, New York, New York, 1979.

    Google Scholar 

  5. F. Gasperoni and U. Schwiegelshohn, Efficient algorithms for cyclic scheduling, IBM technical report RC 17068, August 1992.

    Google Scholar 

  6. K. Iwano and S. Yeh, An efficient algorithm for optimal loop parallelization, in International Symposium on Algorithms, Springer-Verlag, Aug. 1990, pp. 201–210. Lecture Notes in Computer Science 450.

    Google Scholar 

  7. M. Lam, Software pipelining: An effective scheduling technique for VLIW machines, Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation, June 1988, pp. 318–328.

    Google Scholar 

  8. A. Munshi and B. Simons, Scheduling loops on processors: algorithms and complexity, SIAM Journal of Computing, 19 (1990), pp. 728–741.

    MathSciNet  Google Scholar 

  9. A. Zaky and P. Sadayappan, Optimal static scheduling of sequential loops on multiprocessors, in International Conference on Parallel Processing, IEEE, Aug. 1989, pp. III-(130–137).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIMS-NYU, 251 Mercer Street, 10012, New York, NY

    Franco Gasperoni

  2. IBM Research Center, P.O. Box 218, 10598, Yorktown Heights, NY

    Uwe Schwiegeishohn

Authors
  1. Franco Gasperoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Schwiegeishohn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gasperoni, F., Schwiegeishohn, U. (1992). Scheduling loops on parallel processors: A simple algorithm with close to optimum performance. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_463

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_463

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation