DOCSLIB.ORG

Synthesis and Exploration of Loop Accelerators for Systems-On-A-Chip

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Synthesis and Exploration of Loop Accelerators for Systems-On-A-Chip Synthesis and Exploration of Loop Accelerators for Systems-on-a-Chip Der Technischen Fakultät der Universität Erlangen-Nürnberg zur Erlangung des Grades DOKTOR-INGENIEUR vorgelegt von Hritam Dutta Erlangen 2011 Als Dissertation genehmigt von der Technischen Fakultät der Universität Erlangen-Nürnberg Tag der Einreichung: . 10. Januar 2011 Tag der Promotion: . 03. März 2011 Dekan: . Prof. Dr.-Ing. Reinhard German Berichterstatter: . Prof. Dr.-Ing. Jürgen Teich . .Prof. Christian Lengauer, Ph.D. Acknowledgements I owe my deepest gratitude to my adviser, Professor Jürgen Teich, for always being enthusiastic to propose and discuss new ideas. He also provided me a great amount of freedom, and valuable scientific and editorial feedback. I would also like to thank Professor Christian Lengauer for agreeing to serve on my dissertation committee and the suggestions to improve the dissertation. My sincere gratitude also goes to Professor Bernard Pottier and Professor Ulrich Rüde for introducing me to new ideas and fields of research. My special thanks goes to all colleagues, especially, Frank Hannig, Dmitrij Kissler, Joachim Keinert, Richard Membarth, Moritz Schmid, Jens Gladigau, Dirk Koch for brainstorming sessions and intensive co-operation, which led to key scientific progress and enrichment of my knowledge. I appreciate Frank’s patience in reading the whole dissertation and making valuable suggestions. I was fortunate to have won- derful office mates in Mateusz Majer and Tobias Ziermann, and thank them both for all the technical and non-technical discussions. My sincere acknowledgements also goes to external colleagues Sebastian Siegel, Rainer Schaffer (TU Dresden), Wolf- gang Haid (ETH Zürich), Samar Yazdani (UBO, Brest) for co-operation on important research problems. I also appreciate the efforts of undergraduate students, especially, Teddy Zhai and Holger Ruckdeschel, in the software development of PARO method- ology. I am also deeply indebted to Sonja Heidner and Ina Derr for helping me sort out several administrative issues. I greatly value the friendship of all the people who made my stay in Erlangen a real pleasure. My family has been a constant source of love, concern, support, and strength all these years. I would like to express my heart-felt gratitude to my family and dedicate this dissertation to them. Hritam Dutta iii iv Contents 1. Introduction 1 1.1. Next Generation Applications . .3 1.2. Accelerator based SoC Architectures . .5 1.3. Programming Models for SoC . .8 1.4. Problem Definition . 11 1.5. Contributions and Bibliographic notes . 12 1.6. A Guided Tour through the Thesis . 14 2. Fundamentals and Related Work 15 2.1. Algorithm Specification in the Polytope Model . 15 2.1.1. Fundamentals: Algorithm Specification . 15 2.1.2. Specification of Communicating Loop Nests . 20 2.1.3. Related Work . 24 2.2. A Generic Accelerator Scheme . 26 2.2.1. Characterization and Classification of Loop Accelerators . 26 2.2.2. Accelerator Subsystem for Streaming Application . 28 2.3. High-level Synthesis of Hardware Accelerators . 30 2.3.1. Front End: Loop Transformations . 30 2.3.1.1. Program Transformations . 31 2.3.1.2. Tiling . 33 2.3.2. Front End: Scheduling . 34 2.3.2.1. Global Scheduling and Binding . 35 2.3.2.2. Local Scheduling and Resource Binding . 37 2.3.3. Back End: Synthesis . 38 2.3.3.1. Synthesis of Processor Element . 39 2.3.3.2. Synthesis of Array Interconnection Structure . 40 2.3.3.3. Synthesis of Control Hardware . 40 2.4. Accelerator Design Space Exploration . 42 2.5. High-level Synthesis Tools . 44 2.6. Conclusion . 47 3. Accelerator Generation: Loop Transformations and Back End 49 3.1. Loop Optimizations for Accelerator Tuning . 50 3.1.1. Loop Transformations . 51 v Contents 3.1.1.1. Loop Permutation . 53 3.1.1.2. Loop Tiling . 55 3.1.2. Hierarchical Tiling . 56 3.1.2.1. Tiling: Decomposition of the Iteration Space . 62 3.1.2.2. Embedding: Splitting of Data Dependencies . 67 3.1.2.3. Iteration dependent Conditions . 70 3.1.2.4. Parallelization of Tiled Piecewise Linear Algorithms 71 3.1.3. Results: Scalability and Overhead of Hierarchical Tiling . 74 3.2. Controller Generation . 75 3.2.1. Accelerator Control Engine: Architecture and Synthesis Method- ology . 77 3.2.1.1. Counter Generation . 78 3.2.1.2. Determination of Processor Element Type . 88 3.2.1.3. Global and Local Controller Unit . 89 3.2.1.4. Propagation of Global Control and Counter Signals 91 3.2.2. I/O Communication Controller . 92 3.2.2.1. Buffer Modeling and Synthesis . 92 3.2.2.2. I/O Controller Synthesis . 94 3.3. Results . 97 3.3.1. Embedded Computation Motifs . 97 3.3.2. Impact of Compiler Transformations on Controller Overhead 100 3.4. Conclusion . 104 4. Accelerator Subsystem for Streaming Applications: Synthesis and Sys- tem Integration 105 4.1. Communicating Loop Model . 107 4.1.1. Loop Graph . 108 4.1.2. Accelerator Model . 110 4.1.3. Mapping: Putting it all together . 111 4.2. Automated Generation of a Communicating Accelerator Subsystem 116 4.2.1. Modeling of Communication Channels . 118 4.2.1.1. Simplified Windowed Synchronous Data Flow Model118 4.2.1.2. Conversion from the Polyhedral Model to the Data Flow Representation . 119 4.2.2. Multi-dimensional FIFO: Architecture and Synthesis . 127 4.3. Synthesis of Accelerators for MPSoCs . 131 4.3.1. Interface Synthesis . 133 4.3.1.1. Accelerator Memory Map Generation . 133 4.3.1.2. Hardware Wrapper . 135 4.3.1.3. Software Driver . 137 4.3.2. Accelerator Integration in SoC . 139 4.4. Results . 141 vi Contents 4.4.1. Overhead of Communication Primitives . 141 4.4.2. Accelerators as Components in SoC . 143 4.5. Conclusion . 144 5. Design Space Exploration: Accelerator Tuning 145 5.1. Single Accelerator Exploration . 146 5.1.1. Model Representation and Problem Definition . 148 5.1.2. Multiple Objectives . 150 5.1.3. Objective Functions . 151 5.1.3.1. Rapid Estimation Models . 152 5.1.4. Optimization Engine . 154 5.1.4.1. Baseline: Random or Exhaustive Search . 154 5.1.4.2. Evolutionary Algorithms . 155 5.2. Performance Analysis of Accelerators in an SoC System . 161 5.2.1. Modular Performance Analysis (MPA) . 163 5.2.2. Objective Parameter Estimation for Accelerators . 164 5.2.2.1. Accelerator Performance: Service Curve Estima- tion . 166 5.2.3. Optimal Configuration Selection in System Context . 169 5.2.4. Case Study . 170 5.2.4.1. Motion JPEG Decoder . 170 5.3. Conclusion and Summary . 172 6. Conclusions and Outlook 175 6.1. Conclusion . 175 6.2. Future Work . 177 A. Glossary 179 B. Hermite Normal Form 181 C. Loop Benchmarks 183 German Part 195 Bibliography 199 List of Abbreviations 219 Curriculum Vitae 221 vii Contents viii 1. Introduction The ephemeral craving for more and more performance and the famous Moore’s law have been the driving forces behind the evolution of computer architectures. On the other hand, green computing, which stands for reducing the environmental impact of computing devices, is urging increased energy efficiency. Therefore, next gen- eration embedded, desktop, and supercomputing applications are placing extreme performance demands at low energy cost. According to the ITRS Road map 2007 [101], heterogeneous massively parallel computing is the paradigm that needs to be embraced in order to meet the demands of the next generation applications. A heterogeneous massively parallel comput- ing platform consists of numerous specialized cores around multiple general purpose processors, which are not identical from the programming or the implementation standpoint. These architectures are also called system-on-a-chip (SoC) in the area of embedded computing. This is the next step in embedded architecture evolution, where homogeneous many-core architectures are incremented with task-specific spe- cialized cores called accelerators. The block diagram in Figure 1.1 illustrates such an SoC architecture. The control intensive general purpose software is executed se- quentially on the processors. Whereas, the data intensive parts of the applications such as loop programs are offloaded to the corresponding tailored accelerators. According to Gries [79], the following approaches are needed in order to realize the full potential of SoC architectures: • Task specific processors: The need for performance at low power cost lead to the inclusion of task-specific processors also known as acceleration engines. They can be dedicated or offer domain specific programmability. • Correct-by-construction design: The verification and integration time accounts for a large chunk of the development time of SoCs; therefore, the automatic generation of a dedicated accelerator architecture and program code for pro- cessors by a compiler from a high-level specification should replace the error- prone manual design process. Embedded computing is embracing new soft- ware tools for correct-by-construction design. • Hardware/software co-design: The term refers to early system development on higher levels of abstraction and subsequent refinement on an accelerator/pro- cessor system. 1 1. Introduction CPU CPU DSP RAM USB Wireless Video DDR-RAM Accelerator FFT Accelerator RAM Controller Engine Engine Encryption Accelerator Matrix RGB2YUV DMA I/O Engine Multiplication Figure 1.1.: SoC architecture that has multiple processors, special purpose accelera- tors, connectivity IPs (e.g. USB, ...), memories, and controllers, which can be accommodated on a single chip. • Design space exploration: The architect must be aided in pruning of the large design space and in the identification of optimal designs through systematic exploration. However, it is usually the task of the designer to handcraft data intensive parts (i.e., loop programs) in domain-specific languages like VHDL to obtain the best-fit accelerator in terms of performance, cost, and power. The optimizations of such loop specifica- tions exploit partitioning, efficient data reuse, transfer, storage, and other transforma- tions in the programmer’s bag of tricks.
Load more

Recommended publications
  • Expression Rematerialization for VLIW DSP Processors with Distributed Register Files ?
    Expression Rematerialization for VLIW DSP Processors with Distributed Register Files ? Chung-Ju Wu, Chia-Han Lu, and Jenq-Kuen Lee Department of Computer Science, National Tsing-Hua University, Hsinchu 30013, Taiwan {jasonwu,chlu}@pllab.cs.nthu.edu.tw,[email protected] Abstract. Spill code is the overhead of memory load/store behavior if the available registers are not sufficient to map live ranges during the process of register allocation. Previously, works have been proposed to reduce spill code for the unified register file. For reducing power and cost in design of VLIW DSP processors, distributed register files and multi- bank register architectures are being adopted to eliminate the amount of read/write ports between functional units and registers. This presents new challenges for devising compiler optimization schemes for such ar- chitectures. This paper aims at addressing the issues of reducing spill code via rematerialization for a VLIW DSP processor with distributed register files. Rematerialization is a strategy for register allocator to de- termine if it is cheaper to recompute the value than to use memory load/store. In the paper, we propose a solution to exploit the character- istics of distributed register files where there is the chance to balance or split live ranges. By heuristically estimating register pressure for each register file, we are going to treat them as optional spilled locations rather than spilling to memory. The choice of spilled location might pre- serve an expression result and keep the value alive in different register file. It increases the possibility to do expression rematerialization which is effectively able to reduce spill code.
    [Show full text]
  • User-Directed Loop-Transformations in Clang
    User-Directed Loop-Transformations in Clang Michael Kruse Hal Finkel Argonne Leadership Computing Facility Argonne Leadership Computing Facility Argonne National Laboratory Argonne National Laboratory Argonne, USA Argonne, USA [email protected] hfi[email protected] Abstract—Directives for the compiler such as pragmas can Only #pragma unroll has broad support. #pragma ivdep made help programmers to separate an algorithm’s semantics from popular by icc and Cray to help vectorization is mimicked by its optimization. This keeps the code understandable and easier other compilers as well, but with different interpretations of to optimize for different platforms. Simple transformations such as loop unrolling are already implemented in most mainstream its meaning. However, no compiler allows applying multiple compilers. We recently submitted a proposal to add generalized transformations on a single loop systematically. loop transformations to the OpenMP standard. We are also In addition to straightforward trial-and-error execution time working on an implementation in LLVM/Clang/Polly to show its optimization, code transformation pragmas can be useful for feasibility and usefulness. The current prototype allows applying machine-learning assisted autotuning. The OpenMP approach patterns common to matrix-matrix multiplication optimizations. is to make the programmer responsible for the semantic Index Terms—OpenMP, Pragma, Loop Transformation, correctness of the transformation. This unfortunately makes it C/C++, Clang, LLVM, Polly hard for an autotuner which only measures the timing difference without understanding the code. Such an autotuner would I. MOTIVATION therefore likely suggest transformations that make the program Almost all processor time is spent in some kind of loop, and return wrong results or crash.
    [Show full text]
  • Elimination of Memory-Based Dependences For
    Elimination of Memory-Based Dependences for Loop-Nest Optimization and Parallelization: Evaluation of a Revised Violated Dependence Analysis Method on a Three-Address Code Polyhedral Compiler Konrad Trifunovic1, Albert Cohen1, Razya Ladelsky2, and Feng Li1 1 INRIA Saclay { ^Ile-de-France and LRI, Paris-Sud 11 University, Orsay, France falbert.cohen, konrad.trifunovic, [email protected] 2 IBM Haifa Research, Haifa, Israel [email protected] Abstract In order to preserve the legality of loop nest transformations and parallelization, data- dependences need to be analyzed. Memory dependences come in two varieties: they are either data-flow dependences or memory-based dependences. While data-flow de- pendences must be satisfied in order to preserve the correct order of computations, memory-based dependences are induced by the reuse of a single memory location to store multiple values. Memory-based dependences reduce the degrees of freedom for loop transformations and parallelization. While systematic array expansion techniques exist to remove all memory-based dependences, the overhead on memory footprint and the detrimental impact on register-level reuse can be catastrophic. Much care is needed when eliminating memory-based dependences, and this is particularly essential for polyhedral compilation on three-address code representation like the GRAPHITE pass of GCC. We propose and evaluate a technique allowing a compiler to ignore some memory- based dependences while checking for the legality of a given affine transformation. This technique does not involve any array expansion. When this technique is not sufficient to expose data parallelism, it can be used to compute the minimal set of scalars and arrays that should be privatized.
    [Show full text]
  • A General Compilation Algorithm to Parallelize and Optimize Counted Loops with Dynamic Data-Dependent Bounds Jie Zhao, Albert Cohen
    A general compilation algorithm to parallelize and optimize counted loops with dynamic data-dependent bounds Jie Zhao, Albert Cohen To cite this version: Jie Zhao, Albert Cohen. A general compilation algorithm to parallelize and optimize counted loops with dynamic data-dependent bounds. IMPACT 2017 - 7th International Workshop on Polyhedral Compilation Techniques, Jan 2017, Stockholm, Sweden. pp.1-10. hal-01657608 HAL Id: hal-01657608 https://hal.inria.fr/hal-01657608 Submitted on 7 Dec 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A general compilation algorithm to parallelize and optimize counted loops with dynamic data-dependent bounds Jie Zhao Albert Cohen INRIA & DI, École Normale Supérieure 45 rue d’Ulm, 75005 Paris fi[email protected] ABSTRACT iterating until a dynamically computed, data-dependent up- We study the parallelizing compilation and loop nest opti- per bound. Such bounds are loop invariants, but often re- mization of an important class of programs where counted computed in the immediate vicinity of the loop they con- loops have a dynamically computed, data-dependent upper trol; for example, their definition may take place in the im- bound. Such loops are amenable to a wider set of trans- mediately enclosing loop.
    [Show full text]
  • Foundations of Scientific Research
    2012 FOUNDATIONS OF SCIENTIFIC RESEARCH N. M. Glazunov National Aviation University 25.11.2012 CONTENTS Preface………………………………………………….…………………….….…3 Introduction……………………………………………….…..........................……4 1. General notions about scientific research (SR)……………….……….....……..6 1.1. Scientific method……………………………….………..……..……9 1.2. Basic research…………………………………………...……….…10 1.3. Information supply of scientific research……………..….………..12 2. Ontologies and upper ontologies……………………………….…..…….…….16 2.1. Concepts of Foundations of Research Activities 2.2. Ontology components 2.3. Ontology for the visualization of a lecture 3. Ontologies of object domains………………………………..………………..19 3.1. Elements of the ontology of spaces and symmetries 3.1.1. Concepts of electrodynamics and classical gauge theory 4. Examples of Research Activity………………….……………………………….21 4.1. Scientific activity in arithmetics, informatics and discrete mathematics 4.2. Algebra of logic and functions of the algebra of logic 4.3. Function of the algebra of logic 5. Some Notions of the Theory of Finite and Discrete Sets…………………………25 6. Algebraic Operations and Algebraic Structures……………………….………….26 7. Elements of the Theory of Graphs and Nets…………………………… 42 8. Scientific activity on the example “Information and its investigation”……….55 9. Scientific research in Artificial Intelligence……………………………………..59 10. Compilers and compilation…………………….......................................……69 11. Objective, Concepts and History of Computer security…….………………..93 12. Methodological and categorical apparatus of scientific research……………114 13. Methodology and methods of scientific research…………………………….116 13.1. Methods of theoretical level of research 13.1.1. Induction 13.1.2. Deduction 13.2. Methods of empirical level of research 14. Scientific idea and significance of scientific research………………………..119 15. Forms of scientific knowledge organization and principles of SR………….121 1 15.1. Forms of scientific knowledge 15.2.
    [Show full text]
  • Polyhedral-Model Guided Loop-Nest Auto-Vectorization Konrad Trifunović, Dorit Nuzman, Albert Cohen, Ayal Zaks, Ira Rosen
    Polyhedral-Model Guided Loop-Nest Auto-Vectorization Konrad Trifunović, Dorit Nuzman, Albert Cohen, Ayal Zaks, Ira Rosen To cite this version: Konrad Trifunović, Dorit Nuzman, Albert Cohen, Ayal Zaks, Ira Rosen. Polyhedral-Model Guided Loop-Nest Auto-Vectorization. The 18th International Conference on Parallel Architectures and Com- pilation Techniques, Sep 2009, Raleigh, United States. hal-00645325 HAL Id: hal-00645325 https://hal.inria.fr/hal-00645325 Submitted on 27 Nov 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Polyhedral-Model Guided Loop-Nest Auto-Vectorization Konrad Trifunovic †, Dorit Nuzman ∗, Albert Cohen †, Ayal Zaks ∗ and Ira Rosen ∗ ∗IBM Haifa Research Lab, {dorit, zaks, irar}@il.ibm.com †INRIA Saclay, {konrad.trifunovic, albert.cohen }@inria.fr Abstract—Optimizing compilers apply numerous inter- Modern architectures must exploit multiple forms of par- dependent optimizations, leading to the notoriously difficult allelism provided by platforms while using the memory phase-ordering problem — that of deciding which trans- hierarchy efficiently. Systematic solutions to harness the formations to apply and in which order. Fortunately, new infrastructures such as the polyhedral compilation framework interplay of multi-level parallelism and locality are emerg- host a variety of transformations, facilitating the efficient explo- ing, by advances in automatic parallelization and loop nest ration and configuration of multiple transformation sequences.
    [Show full text]
  • Compiler Construction
    Compiler construction PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 10 Dec 2011 02:23:02 UTC Contents Articles Introduction 1 Compiler construction 1 Compiler 2 Interpreter 10 History of compiler writing 14 Lexical analysis 22 Lexical analysis 22 Regular expression 26 Regular expression examples 37 Finite-state machine 41 Preprocessor 51 Syntactic analysis 54 Parsing 54 Lookahead 58 Symbol table 61 Abstract syntax 63 Abstract syntax tree 64 Context-free grammar 65 Terminal and nonterminal symbols 77 Left recursion 79 Backus–Naur Form 83 Extended Backus–Naur Form 86 TBNF 91 Top-down parsing 91 Recursive descent parser 93 Tail recursive parser 98 Parsing expression grammar 100 LL parser 106 LR parser 114 Parsing table 123 Simple LR parser 125 Canonical LR parser 127 GLR parser 129 LALR parser 130 Recursive ascent parser 133 Parser combinator 140 Bottom-up parsing 143 Chomsky normal form 148 CYK algorithm 150 Simple precedence grammar 153 Simple precedence parser 154 Operator-precedence grammar 156 Operator-precedence parser 159 Shunting-yard algorithm 163 Chart parser 173 Earley parser 174 The lexer hack 178 Scannerless parsing 180 Semantic analysis 182 Attribute grammar 182 L-attributed grammar 184 LR-attributed grammar 185 S-attributed grammar 185 ECLR-attributed grammar 186 Intermediate language 186 Control flow graph 188 Basic block 190 Call graph 192 Data-flow analysis 195 Use-define chain 201 Live variable analysis 204 Reaching definition 206 Three address
    [Show full text]
  • Portable Section-Level Tuning of Compiler Parallelized Applications
    Portable Section-level Tuning of Compiler Parallelized Applications Dheya Mustafa and Rudolf Eigenmann Electrical and Computer Engineering Purdue University West Lafayette, USA Email:{dmustaf,eigenman}@purdue.edu Abstract—Automatic parallelization of sequential programs and challenging. We will show that section-level tuning can combined with tuning is an alternative to manual parallelization. outperform whole-program tuning by up to 82%. The chal- This method has the potential to substantially increase productiv- lenge is in managing the drastic growth in the search space ity and is thus of critical importance for exploiting the increased computational power of today’s multicores. A key difficulty is of optimization variants. Empirical tuning methods work by that parallelizing compilers are generally unable to estimate the evaluating many optimization variants and choosing the one performance impact of an optimization on a whole program or a that performs the best at runtime [6]–[10]. During this process, program section at compile time; hence, the ultimate performance they need to consider interactions between the optimization decision today rests with the developer. Building an autotuning variants. This issue is already severe in existing, whole- system to remedy this situation is not a trivial task. This work presents a portable empirical autotuning system that operates at program tuning methods. The effect of an optimization may program-section granularity and partitions the compiler options depend significantly on the presence of another (e.g., unrolling into groups that can be tuned independently. and vectorization influence each other). Therefore, a large To our knowledge, this is the first approach delivering an au- number of combinations of program optimizations need to be toparallelization system that ensures performance improvements evaluated.
    [Show full text]
  • Mipsprotm Fortran 77 Programmer's Guide
    MIPSproTM Fortran 77 Programmer’s Guide 007–2361–009 COPYRIGHT Copyright © 1994, 1999, 2002 - 2003 Silicon Graphics, Inc. All rights reserved; provided portions may be copyright in third parties, as indicated elsewhere herein. No permission is granted to copy, distribute, or create derivative works from the contents of this electronic documentation in any manner, in whole or in part, without the prior written permission of Silicon Graphics, Inc. LIMITED RIGHTS LEGEND The electronic (software) version of this document was developed at private expense; if acquired under an agreement with the USA government or any contractor thereto, it is acquired as "commercial computer software" subject to the provisions of its applicable license agreement, as specified in (a) 48 CFR 12.212 of the FAR; or, if acquired for Department of Defense units, (b) 48 CFR 227-7202 of the DoD FAR Supplement; or sections succeeding thereto. Contractor/manufacturer is Silicon Graphics, Inc., 1600 Amphitheatre Pkwy 2E, Mountain View, CA 94043-1351. TRADEMARKS AND ATTRIBUTIONS Silicon Graphics, SGI, the Silicon Graphics logo, IRIS, IRIX, and Origin are registered trademarks and OpenMP, IRIS 4D, IRIS Power Series, and POWER CHALLENGE are trademarks of Silicon Graphics, Inc. in the United States and other countries worldwide. MIPS, R4000, R4400, R8000, R10000 are registered trademarks and MIPSpro and R12000 are trademarks of MIPS Technologies, Inc. MIPSpro is used under license by Silicon Graphics, Inc. UNIX is a registered trademark of the Open Group in the United States and other countries. VMS and VAX are trademarks of Compaq. Portions of this product and document are derived from material copyrighted by Kuck and Associates, Inc.
    [Show full text]
  • Unified Polyhedral Modeling of Temporal and Spatial Locality
    Unified Polyhedral Modeling of Temporal and Spatial Locality Oleksandr Zinenko, Sven Verdoolaege, Chandan Reddy, Jun Shirako, Tobias Grosser, Vivek Sarkar, Albert Cohen To cite this version: Oleksandr Zinenko, Sven Verdoolaege, Chandan Reddy, Jun Shirako, Tobias Grosser, et al.. Unified Polyhedral Modeling of Temporal and Spatial Locality. [Research Report] RR-9110, Inria Paris. 2017, pp.41. hal-01628798 HAL Id: hal-01628798 https://hal.inria.fr/hal-01628798 Submitted on 6 Nov 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Unified Polyhedral Modeling of Temporal and Spatial Locality Oleksandr Zinenko, Sven Verdoolaege, Chandan Reddy, Jun Shirako, Tobias Grosser, Vivek Sarkar, Albert Cohen RESEARCH REPORT N° 9110 October 2017 Project-Team Parkas ISSN 0249-6399 ISRN INRIA/RR--9110--FR+ENG Unified Polyhedral Modeling of Temporal and Spatial Locality Oleksandr Zinenko*, Sven Verdoolaege, Chandan Reddy* , Jun Shirako§, Tobias Grosser¶, Vivek Sarkar§, Albert Cohen* Project-Team Parkas Research Report n° 9110 | October 2017 | 37 pages Abstract: Despite decades of work in this area, the construction of effective loop nest optimizers and parallelizers continues to be challenging due to the increasing diversity of both loop-intensive application workloads and complex memory/computation hierarchies in modern processors.
    [Show full text]
  • Power and Energy Impact by Loop Transformations
    Power and Energy Impact by Loop Transformations Hongbo Yang†, Guang R. Gao†, Andres Marquez†, George Cai‡, Ziang Hu† † Dept of Electrical and Computer Engineering ‡ Intel Corp University of Delaware 1501 S. Mopac Expressway, Suite 400 Newark, DE 19716 Austin, TX 78746 hyang,ggao,marquez,hu ¡ @capsl.udel.edu [email protected] Power dissipation issues are becoming one of the closely coupled, and we should not evaluate in- major design issues in high performance processor dividual effects in complete isolation. Instead, it architectures. is very useful to assess the combined contribu- In this paper, we study the contribution of com- tion of both, high-level and low-level loop opti- piler optimizations to energy reduction. In particu- mizations. lar, we are interested in the impact of loop optimiza- ¢ In particular, results of our experiments are tions in terms of performance and power tradeoffs. summarized as follow: Both low-level loop optimizations at code generation (back-end) phase, such as loop unrolling and soft- – Loop unrolling reduces execution time ware pipelining, and high-level loop optimizations at through effective exploitation of ILP from program analysis and transformation phase ( front- different iterations and results in energy end), such as loop permutation and tiling, are stud- reduction. ied. – Software pipelining may help in reducing In this study, we use the Delaware Power-Aware total energy consumption – due to the re- Compilation Testbed (Del-PACT) — an integrated duction of the total execution time. How- framework consisting of a modern industry-strength ever, in the two benchmarks we tested, compiler infrastructure and a state-of-the-art micro- the effects of high-level loop transforma- architecture-level power analysis platform.
    [Show full text]
  • Loop Transformations: Convexity, Pruning and Optimization
    Loop Transformations: Convexity, Pruning and Optimization Louis-Noel¨ Pouchet Uday Bondhugula Cedric´ Bastoul The Ohio State University IBM T.J. Watson Research Center University of Paris-Sud 11 [email protected] [email protected] [email protected] Albert Cohen J. Ramanujam P. Sadayappan Nicolas Vasilache INRIA Louisiana State University The Ohio State University Reservoir Labs, Inc. [email protected] [email protected] [email protected] [email protected] Abstract One reason for this widening gap is due to the way loop nest High-level loop transformations are a key instrument in mapping optimizers attempt to decompose the global optimization problem computational kernels to effectively exploit resources in modern into simpler sub-problems. Recent results in feedback-directed op- processor architectures. However, determining appropriate compo- timization [33] indicate that oversimplification of this decomposi- sitions of loop transformations to achieve this remains a signif- tion is largely responsible for the failure. The polyhedral compiler icantly challenging task; current compilers may achieve signifi- framework provides a convenient and powerful abstraction to apply cantly lower performance than hand-optimized programs. To ad- composite transformations in one step [20, 24]. However, the space dress this fundamental challenge, we first present a convex char- of affine transformations is extremely large. Linear optimization in acterization of all distinct, semantics-preserving, multidimensional such a high-dimensional space raises complexity issues and its ef- affine transformations. We then bring together algebraic, algorith- fectiveness is limited by the lack of accurate profitability models. mic, and performance analysis results to design a tractable opti- This paper makes fundamental progresses in the understanding mization algorithm over this highly expressive space.
    [Show full text]