Tiramisu : A Polyhedral Compiler with A Scheduling Language for Targeting High Performance Systems Riyadh

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Unified Backend for Targeting FPGAs from DSLs

  2018cited by this paper
• Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions

  2018influential reference
• Distributed Halide

  2016cited by this paper
• PolyMage: Automatic Optimization for Image Processing Pipelines

  2015cited by this paper
• PENCIL: A Platform-Neutral Compute Intermediate Language for Accelerator Programming

  2015cited by this paper
• Hybrid Hexagonal/Classical Tiling for GPUs

  2014cited by this paper
• Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines

  2013cited by this paper
• Compiling affine loop nests for distributed-memory parallel architectures

  2013cited by this paper
• AlphaZ: A System for Design Space Exploration in the Polyhedral Model

  2012cited by this paper
• Polly - Performing Polyhedral Optimizations on a Low-Level Intermediate Representation

  2012influential reference
• Decoupling algorithms from schedules for easy optimization of image processing pipelines

  2012cited by this paper
• Loop transformations: convexity, pruning and optimization

  2011cited by this paper
• Polyhedron Model

  2011cited by this paper
• GRAPHITE Two Years After First Lessons Learned From Real-World Polyhedral Compilation

  2010cited by this paper
• The Polyhedral Model Is More Widely Applicable Than You Think

  2010cited by this paper
• isl: An Integer Set Library for the Polyhedral Model

  2010influential reference
• Loop Transformation Recipes for Code Generation and Auto-Tuning

  2009cited by this paper
• Anatomy of high-performance matrix multiplication

  2008cited by this paper
• A practical automatic polyhedral parallelizer and locality optimizer

  2008influential reference
• CHiLL : A Framework for Composing High-Level Loop Transformations

  2007cited by this paper
• Effective automatic parallelization of stencil computations

  2007cited by this paper
• POET: Parameterized Optimizations for Empirical Tuning

  2007cited by this paper
• Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies

  2006cited by this paper
• Design of High Performance MVAPICH2: MPI2 over InfiniBand

  2006cited by this paper
• New Complexity Results on Array Contraction and Related Problems

  2005cited by this paper
• Code generation in the polyhedral model is easier than you think

  2004cited by this paper
• A unified framework for schedule and storage optimization

  2001cited by this paper
• Optimizing memory usage in the polyhedral model

  2000influential reference
• Automatic Storage Management for Parallel Programs

  1998cited by this paper
• On privatization of variables for data-parallel execution

  1997cited by this paper
• Array-data flow analysis and its use in array privatization

  1993cited by this paper
• Automatic Array Privatization

  1993cited by this paper
• Communication optimization and code generation for distributed memory machines

  1993cited by this paper
• Array privatization for parallel execution of loops

  1992cited by this paper
• Data Dependence and Data-Flow Analysis of Arrays

  1992cited by this paper
• Dataflow analysis of array and scalar references

  1991cited by this paper
• A Loop Transformation Theory and an Algorithm to Maximize Parallelism

  1991cited by this paper
• Machine Perception of Three-Dimensional Solids

  1963cited by this paper

• FusionStitching: Boosting Memory Intensive Computations for Deep Learning Workloads

  2020cites this paper