On the public citation graph

Polyhedral AST Generation Is More Than Scanning Polyhedra

0 signed · 111 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11688839_16openalex-snapshot
Polyhedral Code Generation in the Real World
inferredcites →https://doi.org/10.1007/3-540-45403-9_5openalex-snapshot
Loop Parallelization Algorithms
inferredcites →https://doi.org/10.1007/3-540-57659-2_31openalex-snapshot
An exact method for analysis of value-based array data dependences
inferredcites →https://doi.org/10.1007/978-0-387-09766-4openalex-snapshot
Encyclopedia of Parallel Computing
inferredcites →https://doi.org/10.1007/978-3-642-15582-6_49openalex-snapshot
isl: An Integer Set Library for the Polyhedral Model
inferredcites →https://doi.org/10.1007/978-3-642-37658-0_2openalex-snapshot
AlphaZ: A System for Design Space Exploration in the Polyhedral Model
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
inferredcites →https://doi.org/10.1023/a:1007516818651openalex-snapshot
Index Set Splitting
inferredcites →https://doi.org/10.1023/a:1007554627716openalex-snapshot
Generation of Efficient Nested Loops from Polyhedra
inferredcites →https://doi.org/10.1023/a:1015460304860openalex-snapshot
Achieving Scalable Locality with Time Skewing
inferredcites →https://doi.org/10.1023/a:1025117523902openalex-snapshot
Parameterized Polyhedra and Their Vertices
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1109/cgo.2007.21openalex-snapshot
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
inferredcites →https://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferredcites →https://doi.org/10.1109/icapp.1995.472180openalex-snapshot
A unifying framework for iteration reordering transformations
inferredcites →https://doi.org/10.1109/ipdps.2010.5470459openalex-snapshot
DynTile: Parametric tiled loop generation for parallel execution on multicore processors
inferredcites →https://doi.org/10.1109/pact.2004.1342537openalex-snapshot
Code generation in the polyhedral model is easier than you think
inferredcites →https://doi.org/10.1109/sc.2012.107openalex-snapshot
Tiling stencil computations to maximize parallelism
inferredcites →https://doi.org/10.1109/sc.2014.29openalex-snapshot
Oil and Water Can Mix: An Integration of Polyhedral and AST-Based Transformations
inferredcites →https://doi.org/10.1109/tpds.2003.1239870openalex-snapshot
An efficient code generation technique for tiled iteration spaces
inferredcites →https://doi.org/10.1142/s0129626412500107openalex-snapshot
POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/1250734.1250780openalex-snapshot
Parameterized tiled loops for free
inferredcites →https://doi.org/10.1145/1362622.1362691openalex-snapshot
Multi-level tiling
inferredcites →https://doi.org/10.1145/1375581.1375594openalex-snapshot
Iterative optimization in the polyhedral model
inferredcites →https://doi.org/10.1145/1375581.1375595openalex-snapshot
A practical automatic polyhedral parallelizer and locality optimizer
inferredcites →https://doi.org/10.1145/183432.183525openalex-snapshot
Static analysis of upper and lower bounds on dependences and parallelism
inferredcites →https://doi.org/10.1145/2254064.2254123openalex-snapshot
Polyhedra scanning revisited
inferredcites →https://doi.org/10.1145/2304576.2304619openalex-snapshot
High-performance code generation for stencil computations on GPU architectures
inferredcites →https://doi.org/10.1145/2362389.2362390openalex-snapshot
Equivalence checking of static affine programs using widening to handle recurrences
inferredcites →https://doi.org/10.1145/2400682.2400713openalex-snapshot
Polyhedral parallel code generation for CUDA
inferredcites →https://doi.org/10.1145/2464996.2467268openalex-snapshot
A stencil compiler for short-vector SIMD architectures
inferredcites →https://doi.org/10.1145/2491956.2462187openalex-snapshot
When polyhedral transformations meet SIMD code generation
inferredcites →https://doi.org/10.1145/2544137.2544141openalex-snapshot
Non-affine Extensions to Polyhedral Code Generation
inferredcites →https://doi.org/10.1145/2544137.2544160openalex-snapshot
Hybrid Hexagonal/Classical Tiling for GPUs
inferredcites →https://doi.org/10.1145/2628071.2628106openalex-snapshot
Tiling and optimizing time-iterated computations on periodic domains
inferredcites →https://doi.org/10.1145/263580.263637openalex-snapshot
Iteration space slicing and its application to communication optimization
inferredcites →https://doi.org/10.1145/2751205.2751248openalex-snapshot
Optimistic Delinearization of Parametrically Sized Arrays
inferredcites →https://doi.org/10.1145/567097.567101openalex-snapshot
Register tiling in nonrectangular iteration spaces
inferredcites →https://doi.org/10.13140/2.1.1313.6968openalex-snapshot
Integer Set Coalescing
inferredcites →https://doi.org/10.13140/rg.2.1.4213.4562openalex-snapshot
Polyhedral Extraction Tool
inferredcites →https://doi.org/10.3403/02444380uopenalex-snapshot
Information technology. Programming languages. C

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-03314-9_11openalex-snapshot
Transitive Closure Based Schedule of Loop Nest Statement Instances
inferred← citeshttps://doi.org/10.1007/978-3-030-72789-5_10openalex-snapshot
A Structured Grid Solver with Polyhedral+Dataflow Representation
inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_28openalex-snapshot
Loop Nest Tiling for Image Processing and Communication Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-65578-9_4openalex-snapshot
Compiling and Optimizing OpenMP 4.X Programs to OpenCL and SPIR
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_19openalex-snapshot
Loopy: Programmable and Formally Verified Loop Transformations
inferred← citeshttps://doi.org/10.1007/978-981-16-0010-4_34openalex-snapshot
Automatic Thread Block Size Selection Strategy in GPU Parallel Code Generation
inferred← citeshttps://doi.org/10.1007/s00607-017-0576-3openalex-snapshot
Generation of parallel synchronization-free tiled code
inferred← citeshttps://doi.org/10.1007/s11227-021-03835-zopenalex-snapshot
Revisiting split tiling for stencil computations in polyhedral compilation
inferred← citeshttps://doi.org/10.1007/s11432-024-4071-6openalex-snapshot
TSCompiler: efficient compilation framework for dynamic-shape models
inferred← citeshttps://doi.org/10.1109/access.2018.2855064openalex-snapshot
Towards Automatic Parallelization of Stream Processing Applications
inferred← citeshttps://doi.org/10.1109/cgo.2017.7863748openalex-snapshot
Optimistic loop optimization
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741260openalex-snapshot
Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection
inferred← citeshttps://doi.org/10.1109/fpl57034.2022.00044openalex-snapshot
POLSCA: Polyhedral High-Level Synthesis with Compiler Transformations
inferred← citeshttps://doi.org/10.1109/hipc.2017.00046openalex-snapshot
Lifting Barriers Using Parallel Polyhedral Regions
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188095openalex-snapshot
Polyhedral Model Guided Automatic GPU Cache Exploitation Framework
inferred← citeshttps://doi.org/10.1109/micro50266.2020.00044openalex-snapshot
Optimizing the Memory Hierarchy by Compositing Automatic Transformations on Computations and Data
inferred← citeshttps://doi.org/10.1109/pact52795.2021.00011openalex-snapshot
Polygeist: Raising C to Polyhedral MLIR
inferred← citeshttps://doi.org/10.1109/sbac-padw.2016.16openalex-snapshot
Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops
inferred← citeshttps://doi.org/10.1145/2814270.2814285openalex-snapshot
Runtime pointer disambiguation
inferred← citeshttps://doi.org/10.1145/2858965.2814285openalex-snapshot
Runtime pointer disambiguation
inferred← citeshttps://doi.org/10.1145/2892208.2892217openalex-snapshot
Input space splitting for OpenCL
inferred← citeshttps://doi.org/10.1145/2925426.2926286openalex-snapshot
Polly-ACC Transparent compilation to heterogeneous hardware
inferred← citeshttps://doi.org/10.1145/3033019.3033022openalex-snapshot
Optimized two-level parallelization for GPU accelerators using the polyhedral model
inferred← citeshttps://doi.org/10.1145/3109482openalex-snapshot
Iterative Schedule Optimization for Parallelization in the Polyhedron Model
inferred← citeshttps://doi.org/10.1145/3177961openalex-snapshot
Visual Program Manipulation in the Polyhedral Model
inferred← citeshttps://doi.org/10.1145/3178372.3179509openalex-snapshot
A polyhedral compilation framework for loops with dynamic data-dependent bounds
inferred← citeshttps://doi.org/10.1145/3178372.3179529openalex-snapshot
Polyhedral expression propagation
inferred← citeshttps://doi.org/10.1145/3211346.3211354openalex-snapshot
Diesel: DSL for linear algebra and neural net computations on GPUs
inferred← citeshttps://doi.org/10.1145/3291773openalex-snapshot
Speeding up Iterative Polyhedral Schedule Optimization with Surrogate Performance Models
inferred← citeshttps://doi.org/10.1145/3330345.3330377openalex-snapshot
Efficient hierarchical online-autotuning
inferred← citeshttps://doi.org/10.1145/3330999openalex-snapshot
Polyhedral Compilation for Multi-dimensional Stream Processing
inferred← citeshttps://doi.org/10.1145/3369382openalex-snapshot
Flextended Tiles
inferred← citeshttps://doi.org/10.1145/3428263openalex-snapshot
Fast linear programming through transprecision computing on small and sparse data
inferred← citeshttps://doi.org/10.1145/3434321openalex-snapshot
Verified code generation for the polyhedral model
inferred← citeshttps://doi.org/10.1145/3447818.3460369openalex-snapshot
Tile size selection of affine programs for GPGPUs using polyhedral cross-compilation
inferred← citeshttps://doi.org/10.1145/3453483.3454106openalex-snapshot
AKG: automatic kernel generation for neural processing units using polyhedral transformations
inferred← citeshttps://doi.org/10.1145/3460434openalex-snapshot
PICO
inferred← citeshttps://doi.org/10.1145/3527328openalex-snapshot
End-to-end translation validation for the halide language
inferred← citeshttps://doi.org/10.1145/3545008.3545031openalex-snapshot
Automatically Generating High-performance Matrix Multiplication Kernels on the Latest Sunway Processor
inferred← citeshttps://doi.org/10.1145/3559009.3569656openalex-snapshot
Parallelizing Neural Network Models Effectively on GPU by Implementing Reductions Atomically
inferred← citeshttps://doi.org/10.1145/3566054openalex-snapshot
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration
inferred← citeshttps://doi.org/10.1145/3570641openalex-snapshot
Autotuning Convolutions Is Easier Than You Think
inferred← citeshttps://doi.org/10.1145/3627535.3638484openalex-snapshot
A Holistic Approach to Automatic Mixed-Precision Code Generation and Tuning for Affine Programs
inferred← citeshttps://doi.org/10.1145/3635305openalex-snapshot
Modeling the Interplay between Loop Tiling and Fusion in Optimizing Compilers Using Affine Relations
inferred← citeshttps://doi.org/10.1145/3665643openalex-snapshot
(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms
inferred← citeshttps://doi.org/10.1145/3689031.3696087openalex-snapshot
SpaceFusion: Advanced Deep Learning Operator Fusion via Space-Mapping Graph
inferred← citeshttps://doi.org/10.1145/3696443.3708951openalex-snapshot
A Priori Loop Nest Normalization: Automatic Loop Scheduling in Complex Applications
inferred← citeshttps://doi.org/10.1145/3716871openalex-snapshot
ARACHNE: Optimizing Distributed Parallel Applications with Reduced Inter-Process Communication
inferred← citeshttps://doi.org/10.1145/3797905.3800508openalex-snapshot
Parametric Mappings for Distributed-Memory Tensor Computations
inferred← citeshttps://doi.org/10.1145/3806056openalex-snapshot
A Decoupled Analytical Model for Tile Size Selection in Affine Programs
inferred← citeshttps://doi.org/10.1186/s12859-018-2008-6openalex-snapshot
Tuning iteration space slicing based tiled multi-core code implementing Nussinov’s RNA folding
inferred← citeshttps://doi.org/10.13140/rg.2.1.3272.9680openalex-snapshot
Live-Range Reordering
inferred← citeshttps://doi.org/10.14257/ijgdc.2016.9.11.12openalex-snapshot
A Survey of Loop Parallelization: Models, Approaches, and Recent Developments
inferred← citeshttps://doi.org/10.15439/2017f19openalex-snapshot
Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs
inferred← citeshttps://doi.org/10.18122/td.1842.boisestateopenalex-snapshot
A Case Study in Representing Scientific Applications ( GeoAc ) Using the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.18122/td/1654/boisestateopenalex-snapshot
Polyhedral+Dataflow Graphs
inferred← citeshttps://doi.org/10.2172/1422949openalex-snapshot
Analytical Cost Metrics : Days of Future Past
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4404openalex-snapshot
Analysis and Optimization of Scientific Applications through Set and Relation Abstractions
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04730openalex-snapshot
Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15103openalex-snapshot
Phism: Polyhedral High-Level Synthesis in MLIR
inferred← citeshttps://doi.org/10.5555/3049832.3049864openalex-snapshot
Optimistic loop optimization
inferred← citeshttps://doi.org/10.70675/4c050d35z5565z4ca8z9993z71d9be91d224openalex-snapshot
Adaptation automatique et semi-automatique des optimisations de programmes
inferred← citeshttps://doi.org/10.70675/9a4b7e14za7f4z4a6ezb5f1z795b20080783openalex-snapshot
A combined language and polyhedral approach to heterogeneous parallelism
inferred← citeshttps://doi.org/10.70675/cd5c49c6z16bdz4b3ez86fez618e2f324b10openalex-snapshot
Programming embedded manycore : refinement and optimizing compilation of a parallel action language for hierarchical state machines
inferred← citeshttps://doi.org/10.70675/ceece872z48a1z47e3zba4ez2753b8df5fe5openalex-snapshot
Génération de code polyédrique efficace : vers plus de parallélisme et moins de contrôle
inferred← citeshttps://doi.org/10.70675/d6848fa8z8279z4addzbe70zd3aeb8bf1959openalex-snapshot
Configurable Polyhedral Scheduling for All-Scenario Deep Learning Compilers
inferred← citeshttps://doi.org/10.70675/eb0f178czd7a4z429cz8c3bz1c08386111b2openalex-snapshot
Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.