research-article

PolyCheck: dynamic verification of iteration space transformations on affine programs

Authors:

Sriram Krishnamoorthy,

Louis-Noël Pouchet,

Fabrice Rastello,

P. SadayappanAuthors Info & Claims

POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Pages 539 - 554

https://doi.org/10.1145/2837614.2837656

Published: 11 January 2016 Publication History

Abstract

High-level compiler transformations, especially loop transformations, are widely recognized as critical optimizations to restructure programs to improve data locality and expose parallelism. Guaranteeing the correctness of program transformations is essential, and to date three main approaches have been developed: proof of equivalence of affine programs, matching the execution traces of programs, and checking bit-by-bit equivalence of program outputs. Each technique suffers from limitations in the kind of transformations supported, space complexity, or the sensitivity to the testing dataset. In this paper, we take a novel approach that addresses all three limitations to provide an automatic bug checker to verify any iteration reordering transformations on affine programs, including non-affine transformations, with space consumption proportional to the original program data and robust to arbitrary datasets of a given size. We achieve this by exploiting the structure of affine program control- and data-flow to generate at compile-time lightweight checker code to be executed within the transformed program. Experimental results assess the correctness and effectiveness of our method and its increased coverage over previous approaches.

References

[1]

Clan, the Chunky Loop Analyzer. http://icps.u-strasbg. fr/˜bastoul.

[2]

GNU GCC. http://gcc.gnu.org.

[3]

ISA 0.13. http://repo.or.cz/w/isa.git.

[4]

ISL, the Integer Set Library. http://repo.or.cz/w/isl.git.

[5]

LLVM. http://llvm.org.

[6]

MIT Cilk. http://supertech.csail.mit.edu/cilk.

[7]

PoCC, the Polyhedral Compiler Collection 1.3. http://pocc. sourceforge.net.

[8]

PolyBench/C 3.2. http://polybench.sourceforge.net.

[9]

C. Alias and D. Barthou. On the recognition of algorithm templates. Electronic Notes in Theoretical Computer Science, 82(2):395–409, 2004.

[10]

W. Bao, S. Krishnamoorthy, L.-N. Pouchet, F. Rastello, and P. Sadayappan. Polycheck: Dynamic verification of iteration space transformations on affine programs. Technical report, OSU/PNNL/INRIA, Nov. 2015. OSU-CISRC-11/15-TR21.

[11]

D. Barthou, P. Feautrier, and X. Redon. On the equivalence of two systems of affine recurrence equations. In Euro-Par 2002 Parallel Processing. 2002.

Digital Library

[12]

M. M. Baskaran, A. Hartono, S. Tavarageri, T. Henretty, J. Ramanujam, and P. Sadayappan. Parameterized tiling revisited. In Proc. of the 8th annual IEEE/ACM international symposium on Code generation and optimization. ACM, 2010.

Digital Library

[13]

C. Bastoul. Code generation in the polyhedral model is easier than you think. In Proc. of the 13th International Conference on Parallel Architectures and Compilation Techniques. IEEE, 2004.

Digital Library

[14]

V. Basupalli, T. Yuki, S. Rajopadhye, A. Morvan, S. Derrien, P. Quinton, and D. Wonnacott. ompVerify: polyhedral analysis for the OpenMP programmer. In OpenMP in the Petascale Era, pages 37– 53. Springer, 2011.

Digital Library

[15]

N. E. Beckman, A. V. Nori, S. K. Rajamani, R. J. Simmons, S. D. Tetali, and A. V. Thakur. Proofs from tests. In Proc. of the 2008 International Symposium on Software Testing and Analysis (ISSTA’08). IEEE, 2010.

Digital Library

[16]

M. A. Bender, J. T. Fineman, S. Gilbert, and C. E. Leiserson. Onthe-fly maintenance of series-parallel relationships in fork-join multithreaded programs. In Proc. of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’04). ACM, 2004.

Digital Library

[17]

R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM (JACM), 46(5):720–748, 1999.

Digital Library

[18]

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: an efficient multithreaded runtime system. In Proc. of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM, 1995.

Digital Library

[19]

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system, volume 30. ACM, 1995.

Digital Library

[20]

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan. A practical automatic polyhedral program optimization system. In ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, 2008.

Digital Library

[21]

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

Digital Library

[22]

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

Digital Library

[23]

C. Flanagan and S. N. Freund. Fasttrack: Efficient and precise dynamic race detection. In Proc. of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’09). ACM, 2009.

Digital Library

[24]

M. Frigo and V. Strumpen. Cache oblivious stencil computations. In Proc. of the 19th annual international conference on Supercomputing. ACM, 2005.

Digital Library

[25]

M. Frigo and V. Strumpen. The cache complexity of multithreaded cache oblivious algorithms. Theory of Computing Systems, 45(2):203– 233, 2009.

Digital Library

[26]

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cacheoblivious algorithms. In Proc. of the 40th Annual Symposium on Foundations of Computer Science. IEEE, 1999.

Digital Library

[27]

P. Gachet, C. Mauras, P. Quinton, and Y. Saouter. Alpha du centaur: a prototype environment for the design of parallel regular alorithms. In Proc. of the 3rd international conference on Supercomputing. ACM, 1989.

Digital Library

[28]

S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semi-automatic composition of loop transformations. International Journal of Parallel Programming, 34(3):261–317, June 2006.

Digital Library

[29]

B. Godlin and O. Strichman. Inference rules for proving the equivalence of recursive procedures. Acta Informatica, 45(6):403–439, 2008.

Digital Library

[30]

M. Griebl, P. Feautrier, and C. Lengauer. Index set splitting. International Journal of Parallel Programming, 28(6):607–631, 2000.

[31]

A. K. Gupta, R. Majumdar, and A. Rybalchenko. From tests to proofs. In Proc. of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’09). Springer, 2009.

Digital Library

[32]

S. Kalvala, R. Warburton, and D. Lacey. Program transformations using temporal logic side conditions. ACM Trans. on Programming Languages and Systems (TOPLAS), 31(4):14, 2009.

Digital Library

[33]

C. Karfa, K. Banerjee, D. Sarkar, and C. Mandal. Verification of loop and arithmetic transformations of array-intensive behaviors. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 32(11):1787–1800, 2013.

Digital Library

[34]

S. Kundu, Z. Tatlock, and S. Lerner. Proving optimizations correct using parameterized program equivalence. ACM SIGPLAN Notices, 44(6):327–337, 2009.

Digital Library

[35]

W. Mansky and E. Gunter. A framework for formal verification of compiler optimizations. In Interactive Theorem Proving. Springer, 2010.

Digital Library

[36]

M. Naik, H. Yang, G. Castelnuovo, and M. Sagiv. Abstractions from tests. In Proc. of the 39th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL’12). ACM, 2012.

Digital Library

[37]

G. C. Necula. Translation validation for an optimizing compiler. ACM SIGPLAN Notices, 35(5):83–94, 2000.

Digital Library

[38]

L. C. Paulson. Isabelle Page. https://www.cl.cam.ac.uk/ research/hvg/Isabelle.

[39]

L. Pouchet. Polyopt/C: A polyhedral optimizer for the rose compiler, 2011.

[40]

H. Prokop. Cache-oblivious algorithms. PhD thesis, Massachusetts Institute of Technology, 1999.

[41]

D. Quinlan, C. Liao, R. Matzke, M. Schordan, T. Panas, R. Vuduc, and Q. Yi. ROSE Web Page. http://www.rosecompiler.org, 2014.

[42]

P. Quinton and V. Van Dongen. The mapping of linear recurrence equations on regular arrays. Journal of VLSI signal processing systems for signal, image and video technology, 1(2):95–113, 1989.

Digital Library

[43]

S. V. Rajopadhye, S. Purushothaman, and R. M. Fujimoto. On synthesizing systolic arrays from recurrence equations with linear dependencies. In Proc. of the 16th annual conference on Foundations of Software Technology and Theoretical Computer Science. Springer, 1986.

Digital Library

[44]

R. Raman, J. Zhao, V. Sarkar, M. T. Vechev, and E. Yahav. Scalable and precise dynamic datarace detection for structured parallelism. In Proc. of the 2012 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’12). ACM, 2012.

Digital Library

[45]

S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson. Eraser: A dynamic data race detector for multithreaded programs. ACM Trans. on Computer Systems (TOCS), 15(4):391–411, 1997.

Digital Library

[46]

M. Schordan, P.-H. Lin, D. Quinlan, and L.-N. Pouchet. Verification of polyhedral optimizations with constant loop bounds in finite state space computations. In Proc. of the 6th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation. Springer, 2014.

[47]

R. Sharma, S. Gupta, B. Hariharan, A. Aiken, P. Liang, and A. V. Nori. A data driven approach for algebraic loop invariants. In Proc. of the 22nd European conference on Programming Languages and Systems (ESOP’13). Springer, 2013.

Digital Library

[48]

J. Shirako, L.-N. Pouchet, and V. Sarkar. Oil and water can mix: Reconciling polyhedral and ast transformations. In IEEE/ACM Conference on Supercomputing (SC’14). IEEE, 2014.

Digital Library

[49]

Y. Tang, R. Chowdhury, C.-K. Luk, and C. E. Leiserson. Coding stencil computations using the pochoir stencil-specification language. In Poster session presented at the 3rd USENIX Workshop on Hot Topics in Parallelism, 2011.

[50]

Y. Tang, R. A. Chowdhury, B. C. Kuszmaul, C.-K. Luk, and C. E. Leiserson. The pochoir stencil compiler. In Proc. of the 32rd annual ACM symposium on Parallelism in algorithms and architectures. ACM, 2011.

Digital Library

[51]

S. Verdoolaege. isl: An integer set library for the polyhedral model. In The 3rd International Congress on Mathematical Software (ICMS’10). Springer, 2010.

Digital Library

[52]

S. Verdoolaege. Counting affine calculator and applications. In The 1st International Workshop on Polyhedral Compilation Techniques (IMPACT’11), 2011.

[53]

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe. Counting integer points in parametric polytopes using Barvinok’s rational functions. Algorithmica, 48(1):37–66, June 2007.

Digital Library

[54]

S. Verdoolaege, G. Janssens, and M. Bruynooghe. Equivalence checking of static affine programs using widening to handle recurrences. ACM Trans. on Programming Languages and Systems (TOPLAS), 34 (3):11, 2012.

Digital Library

[55]

M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.

Digital Library

[56]

W. Zuo, P. Li, D. Chen, L.-N. Pouchet, S. Zhong, and J. Cong. Improving polyhedral code generation for high-level synthesis. In IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS’13). IEEE, 2013.

Digital Library

Cited By

Zheng MShi QLiu XXu XYu LLiu CWei GZhang X(2024)ParDiff: Practical Static Differential Analysis of Network Protocol ParsersProceedings of the ACM on Programming Languages10.1145/36498548:OOPSLA1(1208-1234)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649854
An YTang YYi SPeng LPan XSun GLuo ZLi QZhang J(2024)StreamPIM: Streaming Matrix Computation in Racetrack Memory2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00031(297-311)Online publication date: 2-Mar-2024
https://doi.org/10.1109/HPCA57654.2024.00031
Schaad PSchneider TBen-Nun TCalotoiu AZiogas AHoefler TMohror KArnold DBadia R(2023)FuzzyFlow: Leveraging Dataflow To Find and Squash Program Optimization BugsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3613214(1-15)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3613214
Show More Cited By

Index Terms

PolyCheck: dynamic verification of iteration space transformations on affine programs

Recommendations

PolyCheck: dynamic verification of iteration space transformations on affine programs
POPL '16

High-level compiler transformations, especially loop transformations, are widely recognized as critical optimizations to restructure programs to improve data locality and expose parallelism. Guaranteeing the correctness of program transformations is ...
Affine and unimodular transformations for non-uniform nested loops
ICCOMP'08: Proceedings of the 12th WSEAS international conference on Computers

Performance improvement in the modern parallel machines needs not only to find sufficient parallelism in a program, but it is also important that we minimize the synchronization and communication overheads in the parallelized program. Parallelizing and ...
Affine-by-Statement Transformations of Imperfectly Nested Loops
IPPS '96: Proceedings of the 10th International Parallel Processing Symposium

A majority of loop restructuring techniques developed so far assume that loops are perfectly nested. The unimodular approach unifies three individual transformations -- loop interchange, skewing and reversal -- but is still limited to perfect loop ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 2016

815 pages

ISBN:9781450335492

DOI:10.1145/2837614

General Chair:
Rastislav Bodik
UC Berkeley, USA
,
Program Chair:
Rupak Majumdar
MPI-SWS, Germany

ACM SIGPLAN Notices Volume 51, Issue 1
POPL '16
January 2016
815 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2914770
Editor:
Andy Gill
University of Kansas, Lawrence, KS
Issue’s Table of Contents

Copyright © 2016 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

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 January 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL '16

Sponsor:

SIGPLAN

POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 20 - 22, 2016

FL, St. Petersburg, 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

13
Total Citations
View Citations
372
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zheng MShi QLiu XXu XYu LLiu CWei GZhang X(2024)ParDiff: Practical Static Differential Analysis of Network Protocol ParsersProceedings of the ACM on Programming Languages10.1145/36498548:OOPSLA1(1208-1234)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649854
An YTang YYi SPeng LPan XSun GLuo ZLi QZhang J(2024)StreamPIM: Streaming Matrix Computation in Racetrack Memory2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00031(297-311)Online publication date: 2-Mar-2024
https://doi.org/10.1109/HPCA57654.2024.00031
Schaad PSchneider TBen-Nun TCalotoiu AZiogas AHoefler TMohror KArnold DBadia R(2023)FuzzyFlow: Leveraging Dataflow To Find and Squash Program Optimization BugsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3613214(1-15)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3613214
Kommrusch SMonperrus MPouchet L(2023)Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite RulesIEEE Transactions on Software Engineering10.1109/TSE.2023.327106549:7(3771-3792)Online publication date: Jul-2023
https://doi.org/10.1109/TSE.2023.3271065
Clément BCohen A(2022)End-to-end translation validation for the halide languageProceedings of the ACM on Programming Languages10.1145/35273286:OOPSLA1(1-30)Online publication date: 29-Apr-2022
https://dl.acm.org/doi/10.1145/3527328
Churchill BPadon OSharma RAiken AMcKinley KFisher K(2019)Semantic program alignment for equivalence checkingProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314596(1027-1040)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314596
Gruber FSelva MSampaio DGuillon CMoynault APouchet LRastello FHollingsworth JKeidar I(2019)Data-flow/dependence profiling for structured transformationsProceedings of the 24th Symposium on Principles and Practice of Parallel Programming10.1145/3293883.3295737(173-185)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3293883.3295737
Mutlu EPanyala AKrishnamoorthy S(2018)HPC Software Verification in Action: A Case Study with Tensor Transposition2018 IEEE/ACM 2nd International Workshop on Software Correctness for HPC Applications (Correctness)10.1109/Correctness.2018.00006(9-16)Online publication date: Nov-2018
https://doi.org/10.1109/Correctness.2018.00006
Li MLu XSubramoni HPanda D(2017)Designing Registration Caching Free High-Performance MPI Library with Implicit On-Demand Paging (ODP) of InfiniBand2017 IEEE 24th International Conference on High Performance Computing (HiPC)10.1109/HiPC.2017.00017(62-71)Online publication date: Dec-2017
https://doi.org/10.1109/HiPC.2017.00017
Bao WHong CChunduri SKrishnamoorthy SPouchet LRastello FSadayappan P(2016)Static and Dynamic Frequency Scaling on Multicore CPUsACM Transactions on Architecture and Code Optimization10.1145/301101713:4(1-26)Online publication date: 28-Dec-2016
https://dl.acm.org/doi/10.1145/3011017
Show More Cited By

View Options

Get Access

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