Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra

Conference object, Article English OPEN
Upadrasta , Ramakrishna; Cohen , Albert;

International audience; Polyhedral compilation has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations remain one important weakness. We address it using sub... View more
Share - Bookmark