Treffer: Simplifying reductions
Title:
Simplifying reductions
Authors:
Source:
Conference record of POPL® 2006: The 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages®, January 11-13, 2006, Charleston, South Carolina, USAACM SIGPLAN notices. 41(1):30-41
Publisher Information:
Broadway, NY: ACM, 2006.
Publication Year:
2006
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Analyse programme, Program analysis, Análisis programa, Boucle programme, Program loop, Bucle programa, Complexité calcul, Computational complexity, Complejidad computación, Langage programmation, Programming language, Lenguaje programación, Optimisation compilateur, Compiler optimization, Optimización compiladora, Technique programmation, Programmation technique, Técnica programación, Transformation programme, Program transformation, Transformación programa, Calcul incrémentiel, Modèle polyèdral, Optimisation boucle, Programmation équationnelle, Algorithms, Languages equational programming, incremental computation, loop optimization, polyhedral model, program transformation
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Colorado State University, United States
IRISA, Rennes, France
IRISA, Rennes, France
ISSN:
1523-2867
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17583510
Database:
PASCAL Archive
Weitere Informationen
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benchmarks are ACLs. They often contain reductions: associative and commutative operators applied to a collection of values. They also often exhibit reuse: intermediate values computed or used at different index points being identical. We develop various techniques to automatically exploit reuse to simplify the computational complexity of evaluating reductions. Finally, we present an algorithm for the optimal application of such simplifications resulting in an equivalent specification with minimum complexity.