Quantifier Elimination in Automatic Loop Parallelization
Uloženo v:
| Název: | Quantifier Elimination in Automatic Loop Parallelization |
|---|---|
| Autoři: | Martin Griebl, Christian Lengauer |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www.infosun.fim.uni-passau.de/cl/publications/docs/GGL05jsc.pdf. |
| Rok vydání: | 2005 |
| Sbírka: | CiteSeerX |
| Popis: | We present an application of quantifier elimination techniques in the automatic par-allelization of nested loop programs. The technical goal is to simplify affine inequal-ities whose coefficients may be unevaluated symbolic constants. The values of these so-called structure parameters are determined at run time and reflect the problem size. Our purpose here is to make the research community of quantifier elimination, in a tutorial style, aware of our application domain –loop parallelization – and to highlight the rôle of quantifier elimination, as opposed to alternative techniques, in this domain. Technically, we focus on the elimination method of Weispfenning. Key words: loop parallelization, quantifier elimination 1 |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.640.1646 |
| Dostupnost: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.640.1646 http://www.infosun.fim.uni-passau.de/cl/publications/docs/GGL05jsc.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Přístupové číslo: | edsbas.AC5ABE94 |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | We present an application of quantifier elimination techniques in the automatic par-allelization of nested loop programs. The technical goal is to simplify affine inequal-ities whose coefficients may be unevaluated symbolic constants. The values of these so-called structure parameters are determined at run time and reflect the problem size. Our purpose here is to make the research community of quantifier elimination, in a tutorial style, aware of our application domain –loop parallelization – and to highlight the rôle of quantifier elimination, as opposed to alternative techniques, in this domain. Technically, we focus on the elimination method of Weispfenning. Key words: loop parallelization, quantifier elimination 1 |
|---|