Register Saturation in Data Dependence Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Register Saturation in Data Dependence Graphs


Register constraints in ILP scheduling can be taken into account during the scheduling phase of a code. The complexity of this problem is very high. In this work, we present a new approach consisting in manipulating data dependence graphs to reduce the number of «potential» \vsa without assuming any schedule. We study theoretically the exact upper-bound of the register need for all valid schedules of a code¸: we call this limit the register saturation. It is used to build a modified data dependence graph such that any schedule of this graph will verify the register constraint- s and avoid introducing spill code. We study the case of Direct Acyclic Graphs and then we extend it to loops intended to software pipelining schedule. Experimental study shows that many DAGs and loops do not need register constraints during scheduling.
Fichier principal
Vignette du fichier
RR-3978.pdf (1.59 Mo) Télécharger le fichier

Dates and versions

inria-00072669 , version 1 (24-05-2006)


  • HAL Id : inria-00072669 , version 1


Sid Touati, François Thomasset. Register Saturation in Data Dependence Graphs. [Research Report] RR-3978, INRIA. 2000. ⟨inria-00072669⟩
132 View
214 Download


Gmail Facebook Twitter LinkedIn More