Filters








1,946 Hits in 5.5 sec

Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model [chapter]

Uday Bondhugula, Muthu Baskaran, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan
Lecture Notes in Computer Science  
The approach enables the minimization of inter-tile communication volume in the processor space, and minimization of reuse distances for local execution at each node.  ...  These tiling hyperplanes are used for communication-minimized coarse-grained parallelization as well as for locality optimization.  ...  Acknowledgments We would like to thank Martin Griebl and his team (FMI, Universität Passau, Germany) for the LooPo infrastructure.  ... 
doi:10.1007/978-3-540-78791-4_9 dblp:conf/cc/BondhugulaBKRRS08 fatcat:3hjpycilrbaxvdeft7mqneevve

Towards effective automatic parallelization for multicore systems

Uday Bondhugula, Muthu Baskaran, Albert Hartono, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In this paper we describe our recent efforts towards developing an effective automatic parallelization system that uses a polyhedral model for data dependences and program transformations.  ...  The ubiquity of multicore processors in commodity computing systems has raised a significant programming challenge for their effective use.  ...  Acknowledgments We would like to acknowledge Cédric Bastoul and other contributors to the CLooG code generator and Martin Griebl and team for the LooPo infrastructure.  ... 
doi:10.1109/ipdps.2008.4536401 dblp:conf/ipps/BondhugulaBHKRRS08 fatcat:gv2yaercm5dp7awfy7buz2pvte

A practical automatic polyhedral parallelizer and locality optimizer

Uday Bondhugula, Albert Hartono, J. Ramanujam, P. Sadayappan
2008 SIGPLAN notices  
Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model.Unlike previous polyhedral frameworks, our approach is an end-to-end fully automatic  ...  We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism  ...  In addition, we thank Alain Darte for useful feedback that has helped us improve the presentation. This work was supported in part by the U.S.  ... 
doi:10.1145/1379022.1375595 fatcat:mx5tqjwvdzfelgf4j7rrwb7ojm

A practical automatic polyhedral parallelizer and locality optimizer

Uday Bondhugula, Albert Hartono, J. Ramanujam, P. Sadayappan
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model.Unlike previous polyhedral frameworks, our approach is an end-to-end fully automatic  ...  We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism  ...  In addition, we thank Alain Darte for useful feedback that has helped us improve the presentation. This work was supported in part by the U.S.  ... 
doi:10.1145/1375581.1375595 dblp:conf/pldi/BondhugulaHRS08 fatcat:oxeykavud5fqffeswz3o7k5ote

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 leverage the power and expressiveness of the polyhedral compilation model to develop a multi-objective optimization system for off-chip communications management.  ...  In addition, our proposed framework automatically implements critical optimizations for performance such as task-level parallelization, loop pipelining, and data prefetching.  ...  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

Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework

Louis-Noel Pouchet, Uday Bondhugula, Cedric Bastoul, Albert Cohen, J. Ramanujam, P. Sadayappan
2010 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis  
Existing model-based heuristics for performance optimization used in compilers are limited in their ability to identify profitable parallelism/locality trade-offs and usually lead to sub-optimal performance  ...  tiling, vectorization and parallelization on the transformed program.  ...  ACKNOWLEDGMENT This work was supported in part by the Defense Advanced Research Projects Agency through AFRL Contract FA8650-09-C-7915, the U.S.  ... 
doi:10.1109/sc.2010.14 dblp:conf/sc/PouchetBBCRS10 fatcat:wtvly4ercbai3lo6t7ry4f7tee

Locality-Conscious Nested-Loops Parallelization

Saeed Parsa
2014 ETRI Journal  
Therefore, locality and parallelization may demand different loop transformations.  ...  Applying this transformation results in coarse grain parallelism through exploiting the largest possible groups of outer permutable loops in addition to data locality through dependence satisfaction at  ...  These works mainly focused on data locality optimization for sequential and/or parallel nested loops, whereas our approach focuses on automatic locality conscious nested loops parallelization.  ... 
doi:10.4218/etrij.13.0113.0266 fatcat:ibwilepb3rexzpeg2rdpvyphvq

Improving high level synthesis optimization opportunity through polyhedral transformations

Wei Zuo, Yun Liang, Peng Li, Kyle Rupnow, Deming Chen, Jason Cong
2013 Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays - FPGA '13  
Furthermore, our framework can automatically generate the optimized communication blocks for fine-grained communication between hardware blocks.  ...  Our polyhedral model-based technique systematically defines a set of data access patterns, identifies effective data access patterns, and performs the loop transformations to enable the intra-and inter-block  ...  In the past, polyhedral models have been used for maximizing parallelism while minimizing communcation for parallel computing [18, 2] .  ... 
doi:10.1145/2435264.2435271 dblp:conf/fpga/ZuoLLRCC13 fatcat:iedoyxskbvewniwpqon7brpwzm

Locality-Conscious Nested-Loops Parallelization

Saeed Parsa, Mohammad Hamzei
2014 ETRI Journal  
Therefore, locality and parallelization may demand different loop transformations.  ...  Applying this transformation results in coarse grain parallelism through exploiting the largest possible groups of outer permutable loops in addition to data locality through dependence satisfaction at  ...  These works mainly focused on data locality optimization for sequential and/or parallel nested loops, whereas our approach focuses on automatic locality conscious nested loops parallelization.  ... 
doi:10.4218/etrij.14.0113.0266 fatcat:53npwvnoznbg3pqtev3y36rwci

Progress Report: A Deep Learning Guided Exploration of Affine Unimodular Loop Transformations [article]

Massinissa Merouani, Khaled Afif Boudaoud, Iheb Nassim Aouadj, Nassim Tchoulak, Fatima Benbouzid-Sitayeb, Karima Benatchba, Hugh Leather, Riyadh Baghdadi
2022 arXiv   pre-print
In this paper, we present a work in progress about a deep learning based approach for automatic code optimization in polyhedral compilers.  ...  The proposed technique explores combinations of affine and non-affine loop transformations to find the sequence of transformations that minimizes the execution time of a given program.  ...  Introduction Automatic code optimization is a long-sought goal in the compiler community, It allows the generation of highly optimized code without requiring extensive development effort or domain expertise  ... 
arXiv:2206.03684v1 fatcat:b3wlyteuvbhrnei7rmawrx4cuu

An Interactive Visual Tool for Code Optimization and Parallelization Based on the Polyhedral Model

Eric Papenhausen, Klaus Mueller, M. Harper Langston, Benoit Meister, Richard Lethin
2016 2016 45th International Conference on Parallel Processing Workshops (ICPPW)  
In this paper we present PUMA-V, a visualization interface that helps the user understand and affect the transformations made by R-Stream, an industrial strength optimizing compiler based on the polyhedral  ...  These techniques can simultaneously optimize for a number of performance parameters (i.e. parallelism, locality, etc).  ...  Automatic techniques based on the polyhedral model [4] [5] are particularly promising and have been shown to outperform hand optimized code in some cases [4] .  ... 
doi:10.1109/icppw.2016.52 dblp:conf/icppw/PapenhausenMLML16 fatcat:i7jsbsv3ezer5k5jerluf54ebm

Loop Optimization (Dagstuhl Seminar 18111)

Sebastian Hack, Paul H. J. Kelly, Christian Lengauer, Michael Wagner
2018 Dagstuhl Reports  
The seminar brought together experts from three areas: (1) model-based loop optimization, chiefly, in the polyhedron model, (2) rewriting and program transformation, and (3) metaprogramming and symbolic  ...  Its aim was to review the 20+ years of progress since the Dagstuhl Seminar 9616 "Loop Parallelization" in 1996 and identify the challenges that remain.  ...  The polyhedral model is a powerful tool for program analysis, verification, optimization and parallelization.  ... 
doi:10.4230/dagrep.8.3.39 dblp:journals/dagstuhl-reports/HackKL18 fatcat:ms75ouezgreirnhsr7dk2i7bo4

Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler

Marek Pałkowski, Wlodzimierz Bielecki
2018 Communication Papers of the 2018 Federated Conference on Computer Science and Information Systems  
In this paper, we present automatic loop tiling and parallelization for the minimum cost polygon triangulation (MCPT) task. For this purpose, we use the authorial sourceto-source TRACO compiler.  ...  We tile only the two innermost loops and apply skewing to serialize the outermost one and parallelize the innermost ones.  ...  This disparity between communication and computation prompts to design algorithms for better locality and parallelism.  ... 
doi:10.15439/2018f8 dblp:conf/fedcsis/PalkowskiB18 fatcat:rjaa7gidubhvribnhvgir6nl3m

Speculative Program Parallelization with Scalable and Decentralized Runtime Verification [chapter]

Aravind Sukumaran-Rajam, Juan Manuel Martinez Caamaño, Willy Wolff, Alexandra Jimborean, Philippe Clauss
2014 Lecture Notes in Computer Science  
This strategy is part of the Apollo speculative code parallelizer which is based on an adaptation for dynamic usage of the polyhedral model.  ...  Such a strategy is also against the basic principles since loops in the original serial code are not necessarily parallel and also, it is well-known that the parallel schedule must promote data locality  ...  Targeting such codes for automatic optimization and parallelization imposes to immerse the polytope model in the context of speculative and dynamic parallelization.  ... 
doi:10.1007/978-3-319-11164-3_11 fatcat:k7hv6nqbovgxrcpzspfpy55k5u

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  
Polyhedral models for compiler optimization have demonstrated their strong potential in increasing the program performance, in particular for compute-intensive applications.  ...  We allow for a minimal empirical search on the target machine, discovering on average 83% of the search space optimal combinations in at most 5 runs.  ...  Acknowledgments: This work was funded in part by the U.S.  ... 
doi:10.1007/s10766-013-0241-1 fatcat:x3slz5gqlfdzzhu3jnlyfetjhy
« Previous Showing results 1 — 15 out of 1,946 results