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

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルLanguages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings
編集者David Gelernter, David Sehr, Utpal Banerjee, Alex Nicolau, David Padua
出版社Springer Verlag
ページ97-599
ページ数503
ISBN(印刷版)3540630910, 9783540630913
DOI
出版ステータス出版済み - 1 1 1997
イベント9th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1996 - San Jose, 米国
継続期間: 8 8 19968 10 1996

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1239
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他9th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1996
国/地域米国
CitySan Jose
Period8/8/968/10/96

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Estimating minimum execution time of perfect loop nests with loop-carried dependences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル