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

Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Keijiro Araki, Akira Fukuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 oarallel execution of loons.

Original languageEnglish
Title of host publicationLanguages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings
EditorsDavid Gelernter, David Sehr, Utpal Banerjee, Alex Nicolau, David Padua
PublisherSpringer Verlag
Pages97-599
Number of pages503
ISBN (Print)3540630910, 9783540630913
DOIs
Publication statusPublished - Jan 1 1997
Event9th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1996 - San Jose, United States
Duration: Aug 8 1996Aug 10 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1239
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1996
CountryUnited States
CitySan Jose
Period8/8/968/10/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Estimating minimum execution time of perfect loop nests with loop-carried dependences'. Together they form a unique fingerprint.

Cite this