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

DOI10.1145/2429069.2429127zbMath1301.68092OpenAlexW1975964164MaRDI QIDQ2931828

Albert Cohen, Ramakrishna Upadrasta

Publication date: 27 November 2014

Published in: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00911888/file/popl070-upadrasta.pdf

zbMATH Keywords

optimizationparallelismapproximation algorithmscompiler optimizationsloop transformationsaffine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Neighborhood persistency of the linear optimization relaxation of integer linear optimization ⋮ Incremental closure for systems of two variables per inequality

Uses Software

• Apron
• PPL

This page was built for publication: Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra