Showing cs.PLShow all
2 papers · 1 filter
cs.PL2023
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…
cs.PL2022
Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm
Corentin Ferry, Steven Derrien, Sanjay Rajopadhye
Programs admitting a polyhedral representation can be transformed in many ways for locality and parallelism, notably loop tiling. Data flow analysis can then compute dependence rel…