Filters








3,835 Hits in 5.6 sec

Putting Polyhedral Loop Transformations to Work [chapter]

Cédric Bastoul, Albert Cohen, Sylvain Girbal, Saurabh Sharma, Olivier Temam
2004 Lecture Notes in Computer Science  
We also show that it is possible to generate efficient code after the application of polyhedral program transformations.  ...  For that purpose, we need a generic way to express program transformations and compositions of transformations.  ...  However, our code generator (CLooG) can handle loops with more than 1700 statements. Moreover, the whole source-to-polyhedra-to-source transformation was successfully applied to the 12 benchmarks.  ... 
doi:10.1007/978-3-540-24644-2_14 fatcat:4fs64up7dvdxvo4ylkie7lpyvm

Scaling Data-Intensive Applications on Heterogeneous Platforms with Accelerators

Ana Balevic, Bart Kienhuis
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum  
-Buffered communication and streaming to GPU -Tiling / multi-dimensional strip-mining -Decompose outer loop nest(s) into two loops • Tile-loop • Point-loop -Interchange -Coarse-grain parallelism  ...  , future work: integration with polyhedral process network model and the Compaan compiler framework, application studies, multi-GPU support -Thanks to Compaan Design and NVIDIA for their support!  ... 
doi:10.1109/ipdpsw.2012.230 dblp:conf/ipps/BalevicK12 fatcat:w46lyu4cf5gpfj6eeym5xhm57y

Opening polyhedral compiler's black box

Lénaïc Bagnères, Oleksandr Zinenko, Stéphane Huot, Cédric Bastoul
2016 Proceedings of the 2016 International Symposium on Code Generation and Optimization - CGO 2016  
To address this issue, we propose a technique allowing to automatically translate an arbitrary polyhedral optimization, used internally by loop-level optimization frameworks of several modern compilers  ...  , into a sequence of comprehensible syntactic transformations as long as this optimization focuses on scheduling loop iterations.  ...  In our work, we enable automatic translation from the state-of-the-art polyhedral representation to understandable syntactic transformation primitives and back.  ... 
doi:10.1145/2854038.2854048 dblp:conf/cgo/BagneresZHB16 fatcat:zuuybpd2h5d4pdrszl37ecd67q

Revisiting loop fusion in the polyhedral framework

Sanyam Mehta, Pei-Hung Lin, Pen-Chung Yew
2014 Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14  
Recently, the polyhedral compiler framework with its ability to compose complex transformations, has proved to be promising in performing loop optimizations for small programs.  ...  In our algorithm, we propose several heuristics that work effectively within the polyhedral compiler framework and allow us to achieve the proposed objectives.  ...  work.  ... 
doi:10.1145/2555243.2555250 dblp:conf/ppopp/MehtaLY14 fatcat:ew7day7fpzhqvlhxhvysxxamge

Revisiting loop fusion in the polyhedral framework

Sanyam Mehta, Pei-Hung Lin, Pen-Chung Yew
2014 SIGPLAN notices  
Recently, the polyhedral compiler framework with its ability to compose complex transformations, has proved to be promising in performing loop optimizations for small programs.  ...  In our algorithm, we propose several heuristics that work effectively within the polyhedral compiler framework and allow us to achieve the proposed objectives.  ...  work.  ... 
doi:10.1145/2692916.2555250 fatcat:lmisawk76benlcdawjllb42nle

Predictive modeling in a polyhedral optimization space

Eunjung Park, Louis-Noel Pouche, John Cavazos, Albert Cohen, P. Sadayappan
2011 International Symposium on Code Generation and Optimization (CGO 2011)  
Nevertheless, the problem of finding the best performing combination of loop transformations remains a major challenge.  ...  But since the number of polyhedral optimization alternatives can be enormous, it is often impractical to iterate over a significant fraction of the entire space of polyhedral transformed variants.  ...  Acknowledgments: This work was funded in part by the U.S.  ... 
doi:10.1109/cgo.2011.5764680 dblp:conf/cgo/ParkPCCS11 fatcat:4jf4y3zuwza37bpdp6je5yyrkm

Predictive Modeling in a Polyhedral Optimization Space

Eunjung Park, John Cavazos, Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen, P. Sadayappan
2013 International journal of parallel programming  
Nevertheless, the problem of finding the best performing combination of loop transformations remains a major challenge.  ...  But since the number of polyhedral optimization alternatives can be enormous, it is often impractical to iterate over a significant fraction of the entire space of polyhedral transformed variants.  ...  Acknowledgments: This work was funded in part by the U.S.  ... 
doi:10.1007/s10766-013-0241-1 fatcat:x3slz5gqlfdzzhu3jnlyfetjhy

The Polyhedral Model Is More Widely Applicable Than You Think [chapter]

Mohamed-Walid Benabderrahmane, Louis-Noël Pouchet, Albert Cohen, Cédric Bastoul
2010 Lecture Notes in Computer Science  
The main limitation of the polyhedral model is known to be its restriction to statically predictable, loop-based program parts.  ...  polyhedral model.  ...  Related Work Much work aims at optimizing irregular codes, but only few of them are based on the polyhedral model.  ... 
doi:10.1007/978-3-642-11970-5_16 fatcat:xg5klb3u7nhcpcn6mhrj7lxgoi

Polyhedral parallelization of binary code

Benoit Pradelle, Alain Ketterlin, Philippe Clauss
2012 ACM Transactions on Architecture and Code Optimization (TACO)  
It then uses an off-the-shelf polyhedral parallelizer, first applying appropriate enabling transformations if necessary.  ...  The system is shown to leverage the power of polyhedral parallelization techniques in the absence of source code, with performance approaching those of source-to-source tools.  ...  RELATED WORKS Polyhedral loop transformation is now a well established theory and many tools exist to perform parallelization and transformations in this model such as PLuTo [2, 6] or PoCC/LetSee [8  ... 
doi:10.1145/2086696.2086718 fatcat:d74ovtskcvhnjmlpwsjqjuv444

Polyhedral-based data reuse optimization for configurable computing

Louis-Noel Pouchet, Peng Zhang, P. Sadayappan, Jason Cong
2013 Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays - FPGA '13  
We present a fully automated C-to-FPGA framework to address this problem. Our framework effectively implements data reuse through aggressive loop transformation-based program restructuring.  ...  We leverage the power and expressiveness of the polyhedral compilation model to develop a multi-objective optimization system for off-chip communications management.  ...  Acknowledgment This work was supported by the Center for Domain-Specific Computing (CDSC) funded by NSF "Expeditions in Computing" award 0926127, and the Gigascale Systems Research Center (GSRC).  ... 
doi:10.1145/2435264.2435273 dblp:conf/fpga/PouchetZSC13 fatcat:zaashltg3bcw7pasjfjh6lep3e

The Polyhedral Model of Nonlinear Loops

Aravind Sukumaran-Rajam, Philippe Clauss
2015 ACM Transactions on Architecture and Code Optimization (TACO)  
Plugging together both linear and nonlinear accesses to the dependence prediction model enables the application of polyhedral loop optimizing transformations even for nonlinear code kernels while also  ...  The polyhedral model is a wellknown mathematical model to analyze and optimize loop nests. The current state-of-art tools limit the application of the polyhedral model to static control codes.  ...  Existing loop optimizers that use the polyhedral model can only work on statically analyzable code.  ... 
doi:10.1145/2838734 fatcat:zmysr5it2vd4lnmagdhkzxvowq

A Polyhedral Approach to Ease the Composition of Program Transformations [chapter]

Albert Cohen, Sylvain Girbal, Olivier Temam
2004 Lecture Notes in Computer Science  
This framework is based on a unified polyhedral representation of loops and statements, enabling the application of generalized control and data transformations without reference to a syntactic program  ...  We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of loop transformations and easing their composition in long sequences.  ...  Acknowledgments This work is supported by the "COP" RNTL grant from the French Ministry of Research.  ... 
doi:10.1007/978-3-540-27866-5_38 fatcat:tegxfpz7obdmtiaslfw5wlfhbq

Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies

Sylvain Girbal, Nicolas Vasilache, Cédric Bastoul, Albert Cohen, David Parello, Marc Sigler, Olivier Temam
2006 International journal of parallel programming  
loop transformations, (2) to illustrate how complex transformation sequences may be needed to achieve significant performance benefits, (3) to facilitate the automatic search for program transformation  ...  The proposed framework relies on a unified polyhedral representation of loops and statements, using normalization rules to allow flexible and expressive transformation sequencing.  ...  ACKNOWLEDGMENTS This work is supported by a grant from the French Ministry of Research (RNTL COP) and INRIA, CEA and HP France fellowships.  ... 
doi:10.1007/s10766-006-0012-3 fatcat:czrbuhejuzht5htht4idcisewe

Polyhedral-Model Guided Loop-Nest Auto-Vectorization

Konrad Trifunovic, Dorit Nuzman, Albert Cohen, Ayal Zaks, Ira Rosen
2009 2009 18th International Conference on Parallel Architectures and Compilation Techniques  
This predictive modelling facilitates efficient exploration and educated decision making to best apply various polyhedral loop transformations while considering the subsequent effects of different vectorization  ...  In this paper we examine the interactions between loop transformations of the polyhedral framework and subsequent vectorization.  ...  Part of the work was done while the first author visited the IBM Haifa Research Lab on HiPEAC internship. We would also like to thank Sebastian Pop, AMD and other contributors of the Graphite project.  ... 
doi:10.1109/pact.2009.18 dblp:conf/IEEEpact/TrifunovicNCZR09 fatcat:gm7mb2senfbbjjqw2n7miburja

Facilitating the search for compositions of program transformations

Albert Cohen, Marc Sigler, Sylvain Girbal, Olivier Temam, David Parello, Nicolas Vasilache
2005 Proceedings of the 19th annual international conference on Supercomputing - ICS '05  
The proposed framework relies on a unified polyhedral representation of loops and statements.  ...  Existing compilers are ill-equipped to perform that task because of rigid phase ordering, fragile selection rules using pattern matching, and cumbersome expression of loop transformations on syntax trees  ...  This work is supported by a grant from the French Ministry of Research (RNTL COP) and INRIA, CEA and HP France fellowships.  ... 
doi:10.1145/1088149.1088169 dblp:conf/ics/CohenSGTPV05 fatcat:rx7vshjsn5dyfcgotlsbtbpube
« Previous Showing results 1 — 15 out of 3,835 results