4 papers
Simplification of Polyhedral Reductions in Practice
Louis Narmour, Ryan Job, Tomofumi Yuki +1
Reductions combine collections of inputs with an associative (and here, also commutative) operator to produce collections of outputs. When the same value contributes to multiple ou…
An Irredundant and Compressed Data Layout to Optimize Bandwidth Utilization of FPGA Accelerators
Corentin Ferry, Nicolas Derumigny, Steven Derrien +1
Memory bandwidth is known to be a performance bottleneck for FPGA accelerators, especially when they deal with large multi-dimensional data-sets. A large body of work focuses on re…
An Irredundant Decomposition of Data Flow with Affine Dependences
Corentin Ferry, Steven Derrien, Sanjay Rajopadhye
Optimization pipelines targeting polyhedral programs try to maximize the compute throughput. Traditional approaches favor reuse and temporal locality; while the communicated volume…
Maximal Simplification of Polyhedral Reductions
Louis Narmour, Tomofumi Yuki, Sanjay Rajopadhye
Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multip…