EquiMax. A New Formulation of Acyclic Scheduling Problem for ILP Processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2001

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

Sid Touati
  • Function : Author
  • PersonId : 962200

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
dag_plne.pdf (257.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00646739 , version 1 (23-12-2011)

Identifiers

  • HAL Id : hal-00646739 , version 1

Cite

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⟩
156 View
75 Download

Share

Gmail Facebook X LinkedIn More