Plugging anti and output dependence removal techniques into loop parallelization algorithm

In this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such ‘false’ dependences. These false dependences are removed through the introduction of temporary buffer arrays. Next we show how to plug these techniques into...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel computing Ročník 23; číslo 1; s. 251 - 266
Hlavní autoři: Calland, Pierre-Yves, Darte, Alain, Robert, Yves, Vivien, Frédéric
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 1997
Témata:
Anti dependence
Dependence removal
Loop parallelization algorithm
Output dependence
Loop parallelization algorithm
Anti dependence
Output dependence
Dependence removal
ISSN:0167-8191, 1872-7336
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such ‘false’ dependences. These false dependences are removed through the introduction of temporary buffer arrays. Next we show how to plug these techniques into loop parallelization algorithms (such as Allen and Kennedy's algorithm). The goal is to extract as many parallel loops as the intrinsic degree of parallelism of the nest authorizes, while avoiding a full memory expansion. We try to reduce the number of temporary arrays that we introduce, as well as their dimension.
Bibliografie:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0167-8191
1872-7336
DOI:10.1016/S0167-8191(96)00108-1