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

Fingerprint

Nest
Integer programming
Execution Time
Instruction Level Parallelism
Iteration
Simplex Method
Branch-and-bound
Integer Programming
Optimization
Evaluate
Estimate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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 D. Gelernter, D. Sehr, U. Banerjee, A. Nicolau, & D. Padua (Eds.), Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings (pp. 97-599). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1239). Springer Verlag. https://doi.org/10.1007/BFb0017281

Estimating minimum execution time of perfect loop nests with loop-carried dependences. / Nakanishi, Tsuneo; Joe, Kazuki; Polychronopoulos, Constantine D.; Araki, Keijiro; Fukuda, Akira.

Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings. ed. / David Gelernter; David Sehr; Utpal Banerjee; Alex Nicolau; David Padua. Springer Verlag, 1997. p. 97-599 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1239).

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

Nakanishi, T, Joe, K, Polychronopoulos, CD, Araki, K & Fukuda, A 1997, Estimating minimum execution time of perfect loop nests with loop-carried dependences. in D Gelernter, D Sehr, U Banerjee, A Nicolau & D Padua (eds), Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1239, Springer Verlag, pp. 97-599, 9th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1996, San Jose, United States, 8/8/96. https://doi.org/10.1007/BFb0017281
Nakanishi T, Joe K, Polychronopoulos CD, Araki K, Fukuda A. Estimating minimum execution time of perfect loop nests with loop-carried dependences. In Gelernter D, Sehr D, Banerjee U, Nicolau A, Padua D, editors, Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings. Springer Verlag. 1997. p. 97-599. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0017281
Nakanishi, Tsuneo ; Joe, Kazuki ; Polychronopoulos, Constantine D. ; Araki, Keijiro ; Fukuda, Akira. / Estimating minimum execution time of perfect loop nests with loop-carried dependences. Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings. editor / David Gelernter ; David Sehr ; Utpal Banerjee ; Alex Nicolau ; David Padua. Springer Verlag, 1997. pp. 97-599 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8c6a8fc64bb143ceae587f5a2dc3c3ee,
title = "Estimating minimum execution time of perfect loop nests with loop-carried dependences",
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.",
author = "Tsuneo Nakanishi and Kazuki Joe and Polychronopoulos, {Constantine D.} and Keijiro Araki and Akira Fukuda",
year = "1997",
month = "1",
day = "1",
doi = "10.1007/BFb0017281",
language = "English",
isbn = "3540630910",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "97--599",
editor = "David Gelernter and David Sehr and Utpal Banerjee and Alex Nicolau and David Padua",
booktitle = "Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Nakanishi, Tsuneo

AU - Joe, Kazuki

AU - Polychronopoulos, Constantine D.

AU - Araki, Keijiro

AU - Fukuda, Akira

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957609012&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957609012&partnerID=8YFLogxK

U2 - 10.1007/BFb0017281

DO - 10.1007/BFb0017281

M3 - Conference contribution

SN - 3540630910

SN - 9783540630913

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 97

EP - 599

BT - Languages and Compilers for Parallel Computing - 9th International Workshop, LCPC 1996, Proceedings

A2 - Gelernter, David

A2 - Sehr, David

A2 - Banerjee, Utpal

A2 - Nicolau, Alex

A2 - Padua, David

PB - Springer Verlag

ER -