Skip to main content
SpringerLink
Log in

Estimating minimum execution time of perfect loop nests with loop-carried dependences

  • Poster Session Papers
  • Conference paper
  • First Online:
Languages and Compilers for Parallel Computing (LCPC 1996)

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

  • 99 Accesses

Abstract

We propose a scheme to estimate exact minimum parallel execution time of perfect loop nests with loop-carried dependences at iteration and instruction-level parallelism. We formulate the problem of the estimation as an integer programming problem and solve it with a branch- and-bound scheme combined with the simplex method. Execution time obtained with the proposed scheme is useful to evaluate effects of applications of various optimization or parallelizing techniques for iteration or instruction-level parallel execution of loops.

This work is supported by the Grant-in-Aid of Ministry of Education, Science, Sports and Culture and the Research Fellowships of the Japan Society for the Promotion of Science for Young Scientists.

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

References

  1. T. Nakanishi, K. Joe, C. D. Polychronopoulos, K. Araki, and A. Fukuda, “Estimating Parallel Execution Time of Loops with Loop-Carried Dependences,” Proc. 1996 Int'l Conf. on Parallel Processing, Vol.III, pp.61–69, Aug. 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nara Institute of Science and Technology, 8916-5 Takayamacho, Ikoma, 630-01, Nara, Japan

    Tsuneo Nakanishi, Kazuki Joe & Akira Fukuda

  2. Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1308 West Main, 61801, Urbana, IL, USA

    Constantine D. Polychronopoulos

  3. Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-1 Kasuga Koen, Kasuga, 816, Fukuoka, Japan

    Keijiro Araki

Authors
  1. Tsuneo Nakanishi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuki Joe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Constantine D. Polychronopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Keijiro Araki
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Akira Fukuda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Sehr Utpal Banerjee David Gelernter Alex Nicolau David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakanishi, T., Joe, K., Polychronopoulos, C.D., Araki, K., Fukuda, A. (1997). Estimating minimum execution time of perfect loop nests with loop-carried dependences. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1996. Lecture Notes in Computer Science, vol 1239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017281

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63091-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation