Article

Simplifying reductions

Authors:

S. RajopadhyeAuthors Info & Claims

POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 30 - 41

https://doi.org/10.1145/1111037.1111041

Published: 11 January 2006 Publication History

Abstract

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.

References

[1]

C. Bastoul. Generating loops for scanning polyhedra. Technical Report 2002/23, Versailles University, 2002.

[2]

C. Bastoul, A. Cohen, A. Girbal, S. Sharma, and O. Temam. Putting polyhedral loop transformations to work. In LCPC'16 International Workshop on Languages and Compilers for Parallel Computers, LNCS 2958, 2003.

[3]

R. S. Bird. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst., 6(4):487--504, 1984.

Digital Library

[4]

John Cocke and Ken Kennedy. An algorithm for reduction of operator strength. Commun. ACM, 20(11):850--856, 1977.

Digital Library

[5]

P. Clauss, V. Loechner, and D. Wilde. Deriving formulae to count solutions to parameterized linear systems using ehrhart polynomials: Applications to the analysis of nested-loop programs, 1997.

[6]

F. de Dinechin and S. Robert. Hierarchical static analysis of structured systems of affine recurrence equations. In ASAP, 1996.

Digital Library

[7]

E. Ehrhart. Sur une problème de géométrie diophantine linéaire. J. reine angew. Math., 227:1--29, 1967.

[8]

Paul Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23--53, 1991.

Digital Library

[9]

Paul Feautrier. Some efficient solutions to the affine scheduling problem. part II. multidimensional time. International Journal of Parallel Programming, 21(6):389--420, December 1992.

Digital Library

[10]

Amelia C. Fong. Inductively computable constructs in very high level languages. In POPL '79: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, 1979.

Digital Library

[11]

Gautam and S. Rajopadhye. Simplifying reductions. Technical Report 05-102, Colorado State University, 2005.

[12]

V. Kislenkov, V. Mitrofanov, and E. Zima. Multidimensional chains of recurrences. In ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computation, 1998.

Digital Library

[13]

Yanhong A. Liu, Scott D. Stoller, Ning Li, and Tom Rothamel. Optimizing aggregate array computations in loops. ACM Trans. Program. Lang. Syst., 27(1):91--125, 2005.

Digital Library

[14]

H. Le Verge. Un environnement de transformations de programmmes pour la synthèse d'architectures régulières. PhD thesis, L'Université de Rennes I, IRISA, Campus de Beaulieu, Rennes, France, Oct 1992.

[15]

Rune B. Lyngsø, Michael Zuker, and Christian N. S. Pedersen. Fast evaluation of internal loops in rna secondary structure prediction. Bioinformatics, 15(6):440--445, 1999.

[16]

C. Mauras. ALPHA: un langage équationnel pour la conception et la programmation d'architectures parallèles synchrones. PhD thesis, L'Université de Rennes I, IRISA, Campus de Beaulieu, Rennes, France, December 1989.

[17]

Robert Paige and Shaye Koenig. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst., 4(3):402--454, 1982.

Digital Library

[18]

W. Pugh. A practical algorithm for exact array dependence analysis. Commun. ACM, 35(8):102--114, 1992.

Digital Library

[19]

Fabien Quilleré and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. ACM Trans. Program. Lang. Syst., 22(5):773--815, 2000.

Digital Library

[20]

Fabien Quilleré, Sanjay Rajopadhye, and Doran Wilde. Generation of efficient nested loops from polyhedra. Int. J. Parallel Program., 28(5):469--498, 2000.

Digital Library

[21]

Sanjay Rajopadhye. LACS: a language for affine communication structures. Technical Report RR-2093.

[22]

Xavier Redon and Paul Feautrier. Detection of recurrences in sequential programs with loops. In Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe, 1993.

Digital Library

[23]

D. Wilde. A library for doing polyhedral operations. Technical Report PI 785, IRISA, Rennes, France, Dec 1993.

[24]

Daniel M. Yellin and Robert E. Strom. Inc: a language for incremental computations. ACM Trans. Program. Lang. Syst., 13(2):211--236, 1991.

Digital Library

Cited By

Narmour LDerrien SRajopadhye S(2023)Automatic Algorithm-Based Fault Tolerance (AABFT) of Stencil Computations2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00024(187-198)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00024
Zhao JBastoul CYi YHu JNie WZhang RGeng ZLi CTachon TGan ZKloeckner AMoreira J(2022)Parallelizing Neural Network Models Effectively on GPU by Implementing Reductions AtomicallyProceedings of the International Conference on Parallel Architectures and Compilation Techniques10.1145/3559009.3569656(451-466)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1145/3559009.3569656
Kirousis LKolaitis PLivieratos J(2019)Aggregation of Votes with Multiple Positions on Each IssueACM Transactions on Economics and Computation10.1145/32966757:1(1-25)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3296675
Show More Cited By

Index Terms

Simplifying reductions
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis
    2. Program semantics

Recommendations

Simplifying reductions
Proceedings of the 2006 POPL Conference

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 ...
Optimizing aggregate array computations in loops

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations ...
Loop optimization for aggregate array computations
ICCL '98: Proceedings of the 1998 International Conference on Computer Languages

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2006

432 pages

ISBN:1595930272

DOI:10.1145/1111037

General Chair:
Greg Morrisett
Harvard University, USA
,
Program Chair:
Simon Peyton Jones
Microsoft Research, UK

ACM SIGPLAN Notices Volume 41, Issue 1
Proceedings of the 2006 POPL Conference
January 2006
421 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1111320
Issue’s Table of Contents

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 January 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POPL06

Sponsor:

POPL06: The 33rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2006

January 11 - 13, 2006

South Carolina, Charleston, USA

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
963
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)3

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Narmour LDerrien SRajopadhye S(2023)Automatic Algorithm-Based Fault Tolerance (AABFT) of Stencil Computations2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00024(187-198)Online publication date: 21-Oct-2023
https://doi.org/10.1109/PACT58117.2023.00024
Zhao JBastoul CYi YHu JNie WZhang RGeng ZLi CTachon TGan ZKloeckner AMoreira J(2022)Parallelizing Neural Network Models Effectively on GPU by Implementing Reductions AtomicallyProceedings of the International Conference on Parallel Architectures and Compilation Techniques10.1145/3559009.3569656(451-466)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1145/3559009.3569656
Kirousis LKolaitis PLivieratos J(2019)Aggregation of Votes with Multiple Positions on Each IssueACM Transactions on Economics and Computation10.1145/32966757:1(1-25)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3296675
Kong YSchoenebeck G(2019)An Information Theoretic Framework For Designing Information Elicitation Mechanisms That Reward Truth-tellingACM Transactions on Economics and Computation10.1145/32966707:1(1-33)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3296670
Stoller SLiu Y(2019)Algorithm Diversity for Resilient SystemsData and Applications Security and Privacy XXXIII10.1007/978-3-030-22479-0_19(359-378)Online publication date: 11-Jun-2019
https://doi.org/10.1007/978-3-030-22479-0_19
Karmaker Santu SGeigle CFerguson DCope WKalantzis MSearsmith DZhai C(2018)SOFSATACM SIGKDD Explorations Newsletter10.1145/3299986.329999020:2(21-30)Online publication date: 11-Dec-2018
https://dl.acm.org/doi/10.1145/3299986.3299990
Yao ZMa ZLiu YAmiri Sani AChandramowlishwaran A(2018)SugarACM SIGPLAN Notices10.1145/3296957.317318653:2(519-534)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173186
Guo PHu W(2018)PotluckACM SIGPLAN Notices10.1145/3296957.317318553:2(271-284)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173185
Dickens III BGunawi HFeldman AHoffmann H(2018)StrongBoxACM SIGPLAN Notices10.1145/3296957.317318353:2(708-721)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173183
Ginsbach PRemmelg TSteuwer MBodin BDubach CO'Boyle M(2018)Automatic Matching of Legacy Code to Heterogeneous APIsACM SIGPLAN Notices10.1145/3296957.317318253:2(139-153)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173182
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents