Register Saturation in Superscalar and VLIW Codes

Sid Touati (1)

1 A3 - Advanced analysis to code optimization

The registers constraints can be taken into account during the scheduling phase of an acyclic data dependence graph (DAG): any schedule must minimize the register requirement. In this work, we mathematically study and extend the approach which consists of computing the exact upper-bound of the register need for all the valid schedules, independently of the functional unit constraints. A previous work (URSA) was presented in [5,4]. Its aim was to add some serial arcs to the original DAG such that the worst register need does not exceed the number of available registers. We write an appropriate mathematical formalism for this problem and extend the DAG model to take into account delayed read from and write into registers with multiple registers types. This formulation permits us to provide in this paper better heuristics and strategies (nearly optimal), and we prove that the URSA technique is not sufficient to compute the maximal register requirement, even if its solution is optimal.

Domaines: Autre [cs.OH]

Sid Touati. Register Saturation in Superscalar and VLIW Codes. 10th International Conference (CC 2001), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS 2001), Apr 2001, Gênes, Italy. pp.213-228, ⟨10.1007/3-540-45306-7_15⟩. ⟨inria-00637277⟩