Advertisement

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

  • Tsuneo Nakanishi
  • Kazuki Joe
  • Constantine D. Polychronopoulos
  • Keijiro Araki
  • Akira Fukuda
Poster Session Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1239)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Tsuneo Nakanishi
    • 1
  • Kazuki Joe
    • 1
  • Constantine D. Polychronopoulos
    • 2
  • Keijiro Araki
    • 3
  • Akira Fukuda
    • 1
  1. 1.Graduate School of Information ScienceNara Institute of Science and TechnologyNaraJapan
  2. 2.Center for Supercomputing Research and DevelopmentUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  3. 3.Graduate School of Information Science and Electrical EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations