Paper Info
Title
Alphabets: An Extended Polyhedral Equational Language
Abstract
The polyhedral model is a formalism for reasoning about an important class of compute- and data-intensive kernels in many programs. We extend the model to include (i) while loops, and (ii) nonaffine dependence functions, together with additional reduction-like operators like argmin and k-argmin. We propose a equational language Alphabets, that extends an earlier language Alpha. We prove its closure properties under program transformations, discuss its denotational semantics, and provide operational semantics in the form of a demand-driven code generator. Our work focuses on expressibility, and complements most previous efforts to extend the polyhedral model that address legality of transformations, techniques to choose them to optimize particular criteria, and the dependence analysis needed to bring a program into an extended model.
Year
DOI
Venue
2011
10.1109/IPDPS.2011.206
IPDPS Workshops
Keywords
Field
DocType
earlier language,extended model,polyhedral model,extended polyhedral equational language,denotational semantics,program transformation,equational language alphabets,dependence analysis,operational semantics,additional reduction-like operator,nonaffine dependence function,graphical model,solid modeling,indexes,program analysis,automatic parallelization,alpha language,semantics,formal verification,intermediate representation,mathematical model,code generation,computational modeling
Operational semantics,Computer science,Denotational semantics,Code generation,Frameworks supporting the polyhedral model,Theoretical computer science,Operator (computer programming),While loop,Polytope model,Formal verification
Conference
Citations 
PageRank 
References 
0
0.34
15
Authors
3
Name
Order
Citations
PageRank
S. Rajopadhye1707.80
S. Gupta272.89
D. Kim328535.51