Quantifier Elimination in Automatic Loop Parallelization

Saved in:
Bibliographic Details
Title: Quantifier Elimination in Automatic Loop Parallelization
Authors: Martin Griebl, Christian Lengauer
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www.infosun.fim.uni-passau.de/cl/publications/docs/GGL05jsc.pdf.
Publication Year: 2005
Collection: CiteSeerX
Description: 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
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.640.1646
Availability: 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.
Accession Number: edsbas.AC5ABE94
Database: BASE
Description
Abstract: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