Skip to Main content Skip to Navigation
Book sections

EquiMax. A New Formulation of Acyclic Scheduling Problem for ILP Processors

Sid Touati 1 
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : In this paper, we give a new formulation of acyclic scheduling problem under registers and resources constraints in multiple instructions issuing processors (VLIW and superscalar). Given a direct acyclic data dependence graph G = (V; E), the complexity of our integer linear programming model is bounded ) variables and O(jEj + jV j ) constraints according to a target architecture description. This complexity is better than the complexity of the existing techniques which includes a worst total schedule time factor.
Document type :
Book sections
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Sid Touati Connect in order to contact the contributor
Submitted on : Friday, December 23, 2011 - 1:58:17 PM
Last modification on : Sunday, June 26, 2022 - 11:54:56 AM
Long-term archiving on: : Friday, May 11, 2012 - 3:55:37 PM


Files produced by the author(s)


  • HAL Id : hal-00646739, version 1



Sid Touati. EquiMax. A New Formulation of Acyclic Scheduling Problem for ILP Processors. Gyungho and Pen-Chung Yew. Interaction between Compilers and Computer Architecture, Kluwer Academic Publishers, 2001, 0-7923-7370-7. ⟨hal-00646739⟩



Record views


Files downloads